BFS: Revision history

From Rice Wiki

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

20 March 2024

  • curprev 17:3417:34, 20 March 2024‎ Rice talk contribs‎ 1,739 bytes +337‎ →‎Analysis Tag: Visual edit
  • curprev 17:2417:24, 20 March 2024‎ Rice talk contribs‎ 1,402 bytes +1,402‎ Created page with "{{Infobox Algorithm|runtime=O(V+E)|class=Graph Algorithm}} '''Breadth-first search (BFS)''' is a graph traversal algorithm. = Approach = At the core of BFS is a ''priority queue'' of unvisited nodes''.'' # At the start, the source node has a distance of 0, whereas the rest has infinite distance. The source node is pushed into the queue. # The queue is popped as the first node in the queue is visited. # Upon visiting a node, if the node's distance is infinity (i.e...." Tag: Visual edit
Retrieved from "http://ricefriedegg.com:80/mediawiki/index.php/BFS"