This post is completed by 2 users
|Add to List|
Breadth-First Search/Traversal in a Graph.
What is Breadth-First Search:
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root and explores the neighbor nodes first, before moving to the next level neighbors. (Reference — Wiki)
- For Graph as well we will use the Queue for performing the BFS.
- We will use the boolean to keep a track of the nodes because unlike trees during traversal we might keep moving into the circles by visiting the same nodes repeatedly.
- In our example, we are using an adjacency List for the Graph Representation.
Output: 0 2 1 3 4 5
- Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Hard
- Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Hard