|
Boost Users : |
From: Anton A. Patrushev (anton_at_[hidden])
Date: 2007-01-11 21:31:11
Dear all,
I need to construct a graph with following requirements:
1. Edges should have a cost (trivial)
2. Vertices should have a cost (also trivial)
3. For each edge I need to define a costs of passing from this edge to
any other adjacent edge (my problem is here!)
It means that just vertex cost doesn't work - from one edge I can pass
to several edges through the same vertex and I need separate cost for
each way.
I can't split edges and vertices to many, 'cause in my case it will
drastically increase the data.
Can anybody, please, make an advise how to implement the third rule?
Thanks!
Anton.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net