Can one use topological_sort with the following: typedef adjacency_list 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 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