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?
|CodeGuru Home||VC++ / MFC / C++||.NET / C#||Visual Basic||VB Forums||Developer.com|
Results 1 to 1 of 1
Thread: Dijkstra with equal weights
Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.