Re: [boost-users] [BGL] pathfinding

From: Cromwell Enage (sponage_at_[hidden])
Date: 2004-12-15 00:46:27

--- Douglas Gregor <dgregor_at_[hidden]> wrote:
> 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
that
> "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