Hi! This is what I figured - that it is the inverse. Looks like the BGL has evolved quite far from the date the documentation has been written... Looking at the discussion I am curious what will be decided upon it. Andrews suggestions sound reasonable. Sebastian On Fri, Sep 4, 2009 at 4:51 PM, Jeremiah Willcock <jewillco@osl.iu.edu>wrote:
On Fri, 4 Sep 2009, Sebastian Weber wrote:
Hi!
If I am not wrong, then the vertex(std::size_t i, Graph) function is required in no graph concept at all. However, adjacency_list defines it and csr-graphs use it ...
Did I overlook something or shouldn't the function belong to some graph concept?
I have now made the CSR graphs not use it for other graphs being copied into CSR format. There should not be any other algorithms that use it; however, it is provided by almost all graphs. It is the inverse function to the vertex_index property map. Some graphs also have edge_from_index which is the inverse of the edge_index property map.
-- Jeremiah Willcock _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users