Boost logo

Boost Users :

Subject: [Boost-users] Longest path from u to v in a directed weighted graph
From: Shaun Jackman (sjackman_at_[hidden])
Date: 2011-04-13 20:11:30


I would like to find the longest path from vertex u to vertex v through
a directed graph with positive edge weights. I know that u and v are
choke points in the graph, in that if you start from vertex u and start
following random edges, you will end up at vertex v in pretty short
order. Is dijkstra_shortest_paths the best function for this purpose?

The vertices reachable from u without travelling through v form a small
subgraph of the total graph. I want to avoid exploring beyond v, and I
definitely don't need to know the distances to vertices beyond v.


Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at