2
User
Recs.
Recs.
11
Updates
Last
Updated
Updated
Activity
3 Options
Specs
Specs are quantitative aspects of the option such as the price
Pros
Know any positive aspects of this option?
Cons
Con Requires a large amount of memory
When traversing one tree level, you need a way to know which nodes to traverse once you get to the next one. The way this is done is by storing the pointers to a level's child nodes while searching it. The pointers are stored in a FIFO way, this means that BFS needs a relatively large amount of memory in order to store the pointers. The amount of course depends on the complexity of the graph tree and the amount of nodes and/or levels.
Know any negative aspects of this option?
Recommendations
Breadth-first search
Recommended 4 years ago
PositiveSeshat hasn’t added their experience, pros or cons to their recommendation.
Breadth-first search
Recommended 7 years ago
TalentedPapsukkal hasn’t added their experience, pros or cons to their recommendation.