I want to find the shortest path between two vertices of a unweighted graph.
Is there a better approach than taking Dijkstra with all weights equal to 1?
Printable View
I want to find the shortest path between two vertices of a unweighted graph.
Is there a better approach than taking Dijkstra with all weights equal to 1?