Boost logo

Boost :

Subject: [boost] boost graph.
From: Giorgio Zoppi (giorgio.zoppi_at_[hidden])
Date: 2010-07-21 07:52:19

I've a problem with multiple links on the same vertexes.
For example we've vertex A and vertex B and we want identify two
different edges that they connects to these edges, i.e.
A-->B with cost 6
A-->B with cost 8

Is there any way to tag or label these links and using the dijkstra
algorithm on the graph?


Quiero ser el rayo de sol que cada día te despierta
para hacerte respirar y vivir en me.
"Favola -Moda".

Boost list run by bdawes at, gregod at, cpdaniel at, john at