Hi!<br><br>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...<br><br>Looking at the discussion I am curious what will be decided upon it. Andrews suggestions sound reasonable.<br>
<br>Sebastian<br><br><div class="gmail_quote">On Fri, Sep 4, 2009 at 4:51 PM, Jeremiah Willcock <span dir="ltr">&lt;<a href="mailto:jewillco@osl.iu.edu">jewillco@osl.iu.edu</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div><div></div><div class="h5">On Fri, 4 Sep 2009, Sebastian Weber wrote:<br>
<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hi!<br>
<br>
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<br>
defines it and csr-graphs use it ...<br>
<br>
Did I overlook something or shouldn&#39;t the function belong to some graph concept?<br>
</blockquote>
<br></div></div>
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.<br>
<font color="#888888">
<br>
-- Jeremiah Willcock<br>
_______________________________________________<br>
Boost-users mailing list<br>
<a href="mailto:Boost-users@lists.boost.org" target="_blank">Boost-users@lists.boost.org</a><br>
<a href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost-users</a><br>
</font></blockquote></div><br>