Ticket #3426: graph.typo.patch

File graph.typo.patch, 5.5 KB (added by Mathieu Malaterre <mathieu.malaterre@…>, 13 years ago)

  • libs/graph/doc/Graph.html

     
    6262An edge descriptor corresponds to a unique edge <i>(u,v)</i> in a
    6363graph.  An edge descriptor must be <a
    6464href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default Constructible</I>,
    65 <a
    66 href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>,
    67 and <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
     65<a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>, and
     66<a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
    6867</td>
    6968</tr>
    7069

  • libs/graph/quickbook/concepts/graphs.qbk

     
    1313or more efficient to define a graph implicitly based on some functions.
    1414
    1515The Boost.Graph interface does not appear as a single graph concept. Instead it is
    16 factored into much smaller peices. The reason for this is that the purpose of a
     16factored into much smaller pieces. The reason for this is that the purpose of a
    1717concept is to summarize the requirements for particular algorithms. Any one algorithm
    1818does not need every kind of graph operation, typically only a small subset. Furthermore,
    1919there are many graph data-structures that can not provide efficient implementations of
    … …  
    222222
    223223There are certain sets of graph types that do not allow the addition of parallel edges.
    224224Specifically, if the EdgeList and OutEdgeList of an [adjacency_list] models
    225 [StdUniqueAssociativeContainer], then the graph cannont be a multigraph.
     225[StdUniqueAssociativeContainer], then the graph cannot be a multigraph.
    226226
    227227[heading Indexed Graphs]
    228 Indexed graph provide a specific property, an index, for verticese, edges or both.
    229 Many algorithms require vertex or edge indices for "fast" property acces, often
     228Indexed graph provide a specific property, an index, for vertices, edges or both.
     229Many algorithms require vertex or edge indices for "fast" property access, often
    230230declaring exterior properties as `vector`s and using the indices as random access
    231231iterators to access those properties. These concepts effectively require that
    232232indices are accessible as interior properties of the graph.
    233233
    234234These concepts are provided to help describe interface requirements for algorithms
    235235that allow indices to be provided as an exterior property map. With these concepts,
    236 requirements (and interfaces) can be written more disticntly for algorithms that accept
     236requirements (and interfaces) can be written more distinctly for algorithms that accept
    237237indexed graphs, and those that require adaptation through exterior properties.
    238238
    239239There are two indexed graph concepts: [VertexIndexGraph] and [EdgeIndexGraph].

  • libs/graph/quickbook/concepts/vertex_index_graph.qbk

     
    9191        [`G::vertex_index_type`]
    9292        [
    9393            Returns the index of the given vertex within the graph. This is
    94             equvalent to `get(get(vertex_index, g), v)`.
     94            equivalent to `get(get(vertex_index, g), v)`.
    9595
    9696            *Complexity:* Amortized constant.
    9797        ]

  • libs/graph/quickbook/concepts/dfs_visitor.qbk

     
    2727    [
    2828        [`vis.start_vertex(v,g)`]
    2929        [
    30             This is invoked on the source veretx once before the start of the search.
     30            This is invoked on the source vertex once before the start of the search.
    3131
    3232            *Returns* `void`
    3333        ]
    … …  
    5151    [
    5252        [`vis.tree_edge(e,g)`]
    5353        [
    54             This is invoked on each edge as it becomes a member of the eges that the form the
     54            This is invoked on each edge as it becomes a member of the edges that form the
    5555            search tree.
    5656
    5757            *Returns* `void`
    … …  
    6060    [
    6161        [`vis.back_edge(v,g)`]
    6262        [
    63             This is invoked on the back edges of the graph. For an unidrected graph there
     63            This is invoked on the back edges of the graph. For an undirected graph there
    6464            is some ambiguity between tree edges and back edges since the edge /(u,v)/
    6565            and /(v,u)/ are the same edge, but both `tree_edge(v,g)` and `back_edge(v,g)`
    6666            will be invoked. One way to resolve this ambiguity is to record the tree

  • libs/graph/quickbook/concepts/graph.qbk

     
    2525    [
    2626        [`graph_traits<G>::edge_descriptor`]
    2727        [
    28             An edge descriptor corresponds to a unqie edge /(u,v)/ in a graph. An edge descriptor
     28            An edge descriptor corresponds to a unique edge /(u,v)/ in a graph. An edge descriptor
    2929            must be DefaultConstructible, Assignable, and EqualityComparable. Edge descriptors
    3030            are almost always passed by value.
    3131        ]