Revision as of 12:31, 25 May 2025 edit Ajmullen (talk \| contribs) 77 edits m →Time and space complexity Tag: Visual edit ← Previous edit		Revision as of 16:26, 25 May 2025 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 24,306 edits →Pseudocode: suggest to inline images, to save vertical space Next edit →
Line 35: === More details === [[Image:MapGermanyGraph.svg\|thumb\|250px~~\|center~~\|An example map of [[Southern Germany]] with some connections between cities]]▼ [[Image:GermanyBFS.svg\|thumb\|250px~~\|center~~ \|The breadth-first tree obtained when running BFS on the given map and starting in [[Frankfurt]]]]▼ This non-recursive implementation is similar to the non-recursive implementation of [[depth-first search]], but differs from it in two ways: Line 54 ⟶ 56: === Example === The ~~following~~lower isdiagram ~~an example of~~shows the breadth-first tree obtained by running a BFS on an example graph of [[Germany\|German]] cities (upper diagram) starting from ''Frankfurt'':. ▲[[Image:MapGermanyGraph.svg\|thumb\|250px\|center\|An example map of [[Southern Germany]] with some connections between cities]] ▲[[Image:GermanyBFS.svg\|thumb\|250px\|center \|The breadth-first tree obtained when running BFS on the given map and starting in [[Frankfurt]]]] == Analysis ==

Breadth-first search: Difference between revisions