Graph traversal: Difference between revisions

Revision as of 11:39, 4 February 2019

Revision as of 10:05, 21 March 2019

Line 43:

{{main|Breadth-first search}}

{{expand section|date=October 2012}}

A breadth-first search (BFS) is another technique for traversing a finite graph. BFS visits the neighborsibling vertices before visiting the child vertices, and a [[Queue (abstract data type)|queue]] is used in the search process. This algorithm is often used to find the shortest path from one vertex to another.

====Pseudocode====