[Boost-users] [BGL] Remove all vertices from graph with zero degree

Hi all again! I would really appreciate any ideas how to implement (subject) efficiently with bearing in mind "Iterator" stability. Graph representation is the following: typedef adjacency_list< listS, ///<Store out-edges of each vertex in a std::list vecS, ///<Store vertex set in std::vector bidirectionalS, ///<Graph is directed but with access to in & out edges VertexProperties, EdgeProperties, GraphProperties

Graph;

filtered_graph seems isn't what I need. I would like to right as follow Graph g; remove_empty_vertices(g); //Now g doesn't contain zero degree vertices Many thanks in advance, regards, --dima