Graphs 06: BFS for Single Source Shortest Path on unweighted graphs

Competitive Programming

graphs-06:-bfs-single-source-shortest-path

shivamvermadev (Shivam Verma) July 18, 2019, 3:44pm #1

how 0 1 4 2 3 5 be a path as we cannot go from 1 to 4

Saurabh-Kumar-1331476656958199 (Saurabh Kumar) July 18, 2019, 5:14pm #2

this is a bfs traversal of a graph…