Re: [Boost-bugs] [Boost C++ Libraries] #4386: Some documentation bugs

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #4386: Some documentation bugs
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2010-07-02 12:00:48

#4386: Some documentation bugs
  Reporter: Matthias Berndt <matthias_berndt@…> | Owner: asutton
      Type: Bugs | Status: reopened
 Milestone: To Be Determined | Component: graph
   Version: Boost 1.43.0 | Severity: Problem
Resolution: | Keywords:
Changes (by Matthias Berndt <matthias_berndt@…>):

  * 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?

Ticket URL: <>
Boost C++ Libraries <>
Boost provides free peer-reviewed portable C++ source libraries.

This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:03 UTC