|
Boost Users : |
From: James Sutherland (James.Sutherland_at_[hidden])
Date: 2008-05-02 20:36:59
Can one use topological_sort with the following:
typedef adjacency_list<listS, listS, directedS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
Graph g;
// ... populate graph ...
typedef vector<Vertex> SortVerts;
SortVerts verts;
topological_sort( g, std::back_inserter(verts) );
I currently have this working with a adjacency_list<vecS, vecS,
directedS> graph but I need to use lists so that I don't run into
trouble when I am removing vertices...
Thanks for any advice,
James
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