You could also use a priority queue based search (A*) where you explore all vertices with cost 0 before exploring all vertices with cost 1 etc. Essentially, that is the same as Dijkstra's in this case.
-- DK -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/5Po4JF4ZD_YJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
