15 Dec
2004
15 Dec
'04
5:46 a.m.
I think you want to use breadth_first_search on a reverse_graph, starting from the end vertex. It'll handle cycles and will compute the shortest paths automagically. Of course, you'll need to change
--- Douglas Gregor
"directedS" to "bidirectionalS" in your graph type.
I was going to use dijkstra_shortest_paths as a workaround, but your solution looks better. Thanks! Cromwell D. Enage __________________________________ Do you Yahoo!? Dress up your holiday email, Hollywood style. Learn more. http://celebrity.mail.yahoo.com