Re: [boost] dijkstra_shortest_paths bidirectional

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2001-07-30 09:33:08

Hmm, let me see if I understand your question. Do you want the search to
follow the in-edges of each vertex instead of the out-edges?

If so, then you might try using the reverse_graph adaptor.

http://www.boost.org/libs/graph/doc/reverse_graph.html

Cheers,
Jeremy

On Mon, 30 Jul 2001, Joel Young wrote:
> Does anyone see a quick way to get dijkstra_shortest_paths to use the
> parent of links rather than the child links in a bidirectional graph?

----------------------------------------------------------------------
 Jeremy Siek                        www: http://www.lsc.nd.edu/~jsiek/
 Ph.D. Candidate, IU B'ton          email: jsiek_at_[hidden]
 Summer Manager, AT&T Research      phone: [phone]
----------------------------------------------------------------------