Boost logo

Boost Users :

From: Gustavo Sffffe1nchez (gustsanc_at_[hidden])
Date: 2004-07-30 01:23:50

I don't know exactly how you are traversing those nodes in the path, - ie how do find the path -, but as far as I know you have to use a visitor with an algorithm such as dijisktra shortest paths, so you define the event point, on_finish_vertex for example where you want the visitor to be called. This algorithm also stores in a vector the minimum weight pahts encountered from an specific origin vertex so you can go over those paths from the last vertex to this origin.


Hope to be of help


Message: 10
Date: Thu, 29 Jul 2004 15:33:34 +0200
From: Daniele Carlucci
Subject: [Boost-users] Way to print a route between two nodes
To: boost-users_at_[hidden]
Message-ID: <4108FCAE.8040301_at_[hidden]>
Content-Type: text/plain; charset=us-ascii; format=flowed

Hi all,
there is a way to print a route between two nodes?
If I have for ie: 8 nodes.
A possible route is 1->3->2->6->8
How can I print it?
I have only seen that it's used the way to print for every node, all the
nodes near that one.




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