Category
Level
0-1 BFS is a shortest path algorithm specialized for graphs whose edge weights are only 0 or 1.