|
Boost Users : |
From: Manuel Yguel (manuel.yguel_at_[hidden])
Date: 2006-08-30 08:51:27
Hello,
Does the order of the add_edge() calls for an adjacency_list graph with vecS or
listS OutEdgeList containers defines the access order through out_edge_iterators ?
If true, how to define some add_edge_after() method with the same semantic than
the insert_after method defined for slist in
http://www.sgi.com/tech/stl/Slist.html
Thanks a lot.
P.S. thanks Doug, for your answer concerning graph properties.
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