Boost C++ Libraries: Ticket #4386: Some documentation bugs

status changed; resolution set

Jeremiah Willcock — Thu, 01 Jul 2010 05:09:26 GMT

status new → closed
resolution → fixed

(In [63466]) Fixed various BGL documentation bugs; fixes #4386

status changed; resolution deleted

Fri, 02 Jul 2010 12:00:48 GMT

status closed → reopened
resolution fixed

Hi again,

I am now confused.

the astar_search algorithm takes a VertexListGraph, and A* needs to be able to traverse a vertex's out-edges, thus one can conclude that VertexListGraph must be a refinement of IncidenceGraph
the way i read it, the documentation for the VertexListGraph concept argues in the rationale section that VertexListGraph should be a refinement of IncidenceGraph

And yet, you altered the documentation to say that VertexListGraph doesn't refine IncidenceGraph (which is confirmed by the fact that the VertexListGraphConcept concept checking class doesn't check for out_edge_iterator etc). How does that fit together?

status changed; resolution set

Jeremiah Willcock — Fri, 02 Jul 2010 19:30:58 GMT

status reopened → closed
resolution → fixed

(In [63530]) Changed to using const reference for input graphs; added Incidence Graph requirements to documentation; fixes #4386

status changed; resolution deleted

Dave Abrahams — Tue, 27 Nov 2012 09:48:09 GMT

status closed → reopened
resolution fixed

The confusion about astar_search_no_init's requirements and its template parameter names remains. The text is not very clear on what its requirements should be (presumably IncidenceGraph, but that's only a guess) and its template parameter name still implies VertexListGraph is required.

status changed; resolution set

Jeremiah Willcock — Tue, 27 Nov 2012 22:17:30 GMT

status reopened → closed
resolution → fixed

(In [81602]) Fixed template parameter names; fixes #4386