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.