Given a connected graph with N vertices and M edges. The task is to print the lexicographically smallest BFS traversal of the graph starting from 1.
Note: The vertices are numbered from 1 to N.
Input: N = 5, M = 5 Edges: 1 4 3 4 5 4 3 2 1 5 Output: 1 4 3 2 5 Start from 1, go to 4, then to 3 and then to 2 and to 5. Input: N = 3, M = 2 Edges: 1 2 1 3 Output: 1 2 3
Approach: Instead of doing a normal BFS traversal on the graph, we can use a priority queue(min heap) instead of a simple queue. When a node is visited add its adjacent nodes into the priority queue. Every time, we visit a new node, it will be the one with the smallest index in the priority queue. Print the nodes when every time we visit them starting from 1.
Below is the implementation of the above approach:
1 4 3 2 5
- Print the lexicographically smallest DFS of the graph starting from 1
- Lexicographically Smallest Topological Ordering
- Print all the cycles in an undirected graph
- Convert the undirected graph into directed graph such that there is no path of length greater than 1
- Graph implementation using STL for competitive programming | Set 2 (Weighted graph)
- Detect cycle in the graph using degrees of nodes of graph
- Burn the binary tree starting from the target node
- Number of loops of size k starting from a specific node
- Hypercube Graph
- Bridges in a graph
- Biconnected graph
- Graph and its representations
- Islands in a graph using BFS
- Transpose graph
- BFS for Disconnected Graph
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.