Breadth-first search: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 23:5523:55, 2 April 2025 2601:1c2:b01:a020:19db:ae81:b56d:f61a talk 14,117 bytes +171 Undid revision 1283674363 by 2601:1C2:B01:A020:19DB:AE81:B56D:F61A (talk) undo Tag: Undo
curprev 23:4923:49, 2 April 2025 2601:1c2:b01:a020:19db:ae81:b56d:f61a talk 13,946 bytes −171 Claim about delayed check is inconsistent with the pseudocode as written on the DFS page. undo Tag: Reverted

curprev 07:1207:12, 12 March 2025 Citation bot talk contribs 14,117 bytes +66 Add: publisher, date. | Use this bot. Report bugs. | Suggested by Dominic3203 | Linked from User:Jim.belk/Most_viewed_math_articles_(2010) | #UCB_webform_linked 112/998 undo

curprev 08:4708:47, 9 March 2025 David Eppstein talk contribs 14,051 bytes +28 Richard E. Korf undo

curprev 02:3702:37, 11 February 2025 71.61.211.174 talk 14,023 bytes +27 Added Dijkstra to "See Also" section undo

curprev 22:4722:47, 27 October 2024 2604:2800:1:2dc0:659d:91d4:6c13:9d26 talk 13,996 bytes −4 →Pseudocode: I removed the italicization from "starting vertex." undo

curprev 14:2114:21, 25 October 2024 Citation bot talk contribs 14,000 bytes +44 Altered pages. Added publisher. Formatted dashes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Graph algorithms | #UCB_Category 13/132 undo

curprev 19:5419:54, 12 October 2024 JJMC89 bot III talk contribs m 13,956 bytes −10 Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4 undo Tag: Manual revert
curprev 02:2102:21, 12 October 2024 JJMC89 bot III talk contribs m 13,966 bytes +10 Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms undo Tag: Reverted

curprev 00:4000:40, 16 September 2024 David Eppstein talk contribs 13,956 bytes +41 partial undo; i don't care about the infobox, but the more citations needed banner is still valid undo

curprev 23:2623:26, 15 September 2024 Madeleinesinging talk contribs 13,915 bytes −396 No edit summary undo

curprev 10:2210:22, 14 May 2024 ClueBot NG talk contribs m 14,311 bytes −23 Reverting possible vandalism by 203.190.8.116 to version by David Eppstein. Report False Positive? Thanks, ClueBot NG. (4323104) (Bot) undo Tag: Rollback
curprev 10:2210:22, 14 May 2024 203.190.8.116 talk 14,334 bytes +23 →More details undo Tag: Reverted

curprev 21:2221:22, 20 January 2024 David Eppstein talk contribs m 14,311 bytes 0 Reverted edit by 90.146.39.116 (talk) to last version by StereoFolic undo Tag: Rollback
curprev 19:5419:54, 20 January 2024 90.146.39.116 talk 14,311 bytes 0 →A queue is Last in First out, a stack is FIFO, not the other way round undo Tags: Reverted Disambiguation links added

curprev 18:4118:41, 14 January 2024 StereoFolic talk contribs 14,311 bytes +280 Qualify DFS/BFS memory usage difference as *typical* and add source. Worst case space complexity in either case is still O(|V|) undo Tag: Visual edit
curprev 16:4616:46, 14 January 2024 Jochen Burghardt talk contribs 14,031 bytes +111 Partly undid revision 1195188153 by StereoFolic (talk): BFS needs 1 pointer per node in a depth level, while DFS(ID) needs 1 pointer per depth level undo

curprev 21:2721:27, 12 January 2024 Toomuchcuriosity talk contribs 13,920 bytes +24 →More details: Added clarifying term to contrast FIFO with LIFO undo
curprev 18:2218:22, 12 January 2024 StereoFolic talk contribs 13,896 bytes −79 Intro: Remove incorrect statement - DFS also requires memory in its (often implicit) stack undo Tag: Visual edit

curprev 15:4115:41, 27 December 2023 StarryGrandma talk contribs 13,975 bytes +35 →External links: put navigational template back undo

curprev 20:4420:44, 24 October 2023 InternetArchiveBot talk contribs 13,940 bytes +184 Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 undo

curprev 19:2019:20, 10 October 2023 Jochen Burghardt talk contribs 13,756 bytes −10 Undid revision 1179528507 by 2A02:8071:2B83:E640:0:0:0:D78B again: the goal state is searached for, it is not given as input; "v is the goal" means "v satisfies some properties thus identifying it as a goal state (e.g. reaches the exterior of the maze)" undo Tag: Undo
curprev 18:3618:36, 10 October 2023 2a02:8071:2b83:e640::d78b talk 13,766 bytes +10 →Pseudocode undo Tag: Reverted

curprev 18:3918:39, 8 September 2023 David Eppstein talk contribs 13,756 bytes +178 both cases; note that both the repetition-allowed and repetition-prevented cases are studied in different contexts undo
curprev 18:3618:36, 8 September 2023 David Eppstein talk contribs 13,578 bytes +12 Undid revision 1174478288 by Jochen Burghardt (talk) BFS works fine for digraphs and is very important for them undo Tag: Undo
curprev 17:4917:49, 8 September 2023 Jochen Burghardt talk contribs 13,566 bytes −12 →top: boldly restrict generalization to *undirected* graphs: all following examples appear to fall into this class, and handling of e.g. a directed raph with two nodes with outgoing edges only seems to be a problem undo Tag: Reverted

curprev 21:1521:15, 7 September 2023 Jochen Burghardt talk contribs 13,578 bytes −10 Undid revision 1174311118 by Cryptogoth (talk): the goal state is searached for, it is not given as input; "v is the goal" means "v satisfies some properties thus identifying it as a goal state (e.g. reaches the exterior of the maze)" undo Tag: Undo
curprev 17:1517:15, 7 September 2023 Learner-long-life talk contribs m 13,588 bytes +10 The pseudocode depends on checking whether a newly explored node `v` is the goal state, but doesn't pass it in as a parameter. undo Tag: Reverted

curprev 10:5510:55, 26 July 2023 ISaveNewspapers talk contribs m 13,578 bytes 0 ce undo

curprev 00:0600:06, 24 July 2023 Citation bot talk contribs 13,578 bytes +16 Add: s2cid. | Use this bot. Report bugs. | #UCB_CommandLine 239/9214 undo

curprev 05:2205:22, 4 July 2023 Riyarr talk contribs m 13,562 bytes +3 later developed by C. Y. Lee into a wire routing algorithm (published in 1961). undo Tags: Visual edit Mobile edit Mobile web edit

curprev 21:3621:36, 21 May 2023 ChromeGames talk contribs m 13,559 bytes −53 Changing short description from "Algorithm for searching the nodes of a graph in order by their hop count from a starting node" to "Algorithm to search the nodes of a graph" undo Tag: Shortdesc helper

curprev 23:1523:15, 27 February 2023 Jochen Burghardt talk contribs 13,612 bytes −42 →External links: now in side tab undo
curprev 22:2122:21, 27 February 2023 Vozul talk contribs 13,654 bytes +6 Replaced bloated sidebar with new navbox undo

curprev 00:2200:22, 23 November 2022 Uni3993 talk contribs 13,648 bytes −25 →External links undo Tag: 2017 wikitext editor
curprev 00:0900:09, 23 November 2022 Uni3993 talk contribs 13,673 bytes −9 →External links undo Tag: 2017 wikitext editor

curprev 09:5909:59, 21 November 2022 Citation bot talk contribs 13,682 bytes +29 Alter: template type. Add: pages, issue. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 2027/3849 undo

curprev 14:5614:56, 2 November 2022 Swedishpancaces talk contribs 13,653 bytes +43 re-add ''w''.parent := ''v'' as it is referenced in the article. undo

curprev 20:2020:20, 2 June 2022 Toreau talk contribs m 13,610 bytes −2 No edit summary undo

curprev 10:5510:55, 24 April 2022 WikiLinuz talk contribs 13,612 bytes −147 Reverted 1 edit by NeptoTech (talk): Spam undo Tags: Twinkle Undo
curprev 06:0806:08, 24 April 2022 NeptoTech talk contribs m 13,759 bytes +147 Added a website that shows demo on solving maze with BFS undo Tags: Reverted possible conflict of interest

curprev 18:1818:18, 23 April 2022 WikiLinuz talk contribs 13,612 bytes +1 No edit summary undo
curprev 18:1818:18, 23 April 2022 WikiLinuz talk contribs 13,611 bytes −2 No edit summary undo

curprev 14:3714:37, 22 April 2022 WikiLinuz talk contribs 13,613 bytes −112 →External links: rm spam undo
curprev 14:3514:35, 22 April 2022 WikiLinuz talk contribs 13,725 bytes −113 ce img caption undo Tag: Visual edit: Switched
curprev 14:2914:29, 22 April 2022 NeptoTech talk contribs m 13,838 bytes +193 Added a gif to explain how BFS search a maze undo Tag: Visual edit: Switched

curprev 18:0618:06, 14 April 2022 WikiLinuz talk contribs 13,645 bytes −135 Reverted 1 edit by Md Ali Azad (talk): Spam undo Tags: Twinkle Undo
curprev 17:5917:59, 14 April 2022 Md Ali Azad talk contribs m 13,780 bytes +135 →External links undo Tags: citing a blog or free web host Reverted Visual edit

curprev 07:1107:11, 4 March 2022 Alhadis talk contribs 13,645 bytes 0 PNG -> SVG undo Tags: Mobile edit Mobile web edit

curprev 06:5706:57, 23 January 2022 106.212.156.166 talk 13,645 bytes −11 →Completeness undo

2 April 2025

12 March 2025

9 March 2025

11 February 2025

27 October 2024

25 October 2024

12 October 2024

16 September 2024

15 September 2024

14 May 2024

20 January 2024

14 January 2024

12 January 2024

27 December 2023

24 October 2023

10 October 2023

8 September 2023

7 September 2023

26 July 2023

24 July 2023

4 July 2023

21 May 2023

27 February 2023

23 November 2022

21 November 2022

2 November 2022

2 June 2022

24 April 2022

23 April 2022

22 April 2022

14 April 2022

4 March 2022

23 January 2022