On May 10, 2005, at 3:56 AM, Andreas Fabri wrote:

in order to store planar graphs, I am wondering if the graph classes of the BGL allow to enforce an order of the edges which are adjacent to a vertex.

Also is it possible to add an edge between two edges.

Unfortunately, the answer to both of these is currently "no". If you use an adjacency_list with EdgeListS=vecS or EdgeListS=listS, then the edges will always be stored in the order they were added. Doug