##
0-1 BFS (Shortest Path in a Binary Weight Graph)
April 23, 2017

Given a graph where every edge has weight as either 0 or 1. A source vertex is also given in the graph. Find the shortest path from source vertex to every other vertex. Input : Source Vertex = 0 and below graph Output : Shortest distances from given source 0 0 1 1 2 1… Read More »