Andreas Fabri schrieb:

Hello,

Does anybody work on extending the graph concept hierarchy of the BGL in order to deal with graphs that are embedded, that is the edges which are adjacent to a vertex are ordered consistently, and if you go from an edge to the successor edge at a vertex you walk along a face. Maybe even another graph concept where the faces can have holes.

I ask because we already write graph traits specializations for the polyhedral surface of CGAL, which uses a halfedge data structure, and I don't want to reinvent the wheel in case all the terminology is already existing, and I only haven't found it yet.

You mean planar graphs and the like? No, unfortunately not, see http://www.boost.org/libs/graph/doc/challenge.html But such a thing would be highly appreciated by many people including me ... So, if you have things like your additions to graph_traits, a PlanarGraph concept and things like that, I'd definitely like to see it.