|
Boost Users : |
From: Chartier Nicolas (inspear_at_[hidden])
Date: 2008-04-17 06:04:08
I'm rather new with the use of the BGL, but I'd like to know how I
could retrieve a weighted edges list from a graph, without forgetting
vertices and weight, in a list for example, i.e. for n edges:
Element 1 : egde 1; node 1; node 1; weight 1
Element 2 : egde 2; node 2; node 2; weight 2
...
Element n : egde n; node n; node n; weight n
Also, Id like to know if I have different lists from different
graphs, is there a mean to merge them into only one big list and to
remove the unnecessary elements?
Any suggestion welcome ;)
NC
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