Ticket #3409: bgl_typo.patch
File bgl_typo.patch, 2.9 KB (added by , 13 years ago) |
---|
-
libs/graph/doc/IncidenceGraph.html
76 76 77 77 <TR> 78 78 <TD><pre>boost::graph_traits<G>::degree_size_type</pre> 79 The unsigned inte rgral type used for representing the number79 The unsigned integral type used for representing the number 80 80 out-edges or incident edges of a vertex. 81 81 </TD> 82 82 </TR> … … 108 108 <TT>u</TT> in graph <TT>g</TT>. The source vertex of an edge obtained 109 109 via an out edge iterator is guaranteed (for both directed and 110 110 undirected graphs) to be the vertex <tt>u</tt> used in the call to 111 <tt>out_edges(u, g)</tt> and the target vertex must the a vertex111 <tt>out_edges(u, g)</tt> and the target vertex must be a vertex 112 112 adjacent to <tt>u</tt>.<a href="#1">[1]</a> 113 113 <br> 114 114 Return type: <TT>std::pair<out_edge_iterator, out_edge_iterator></TT> -
libs/graph/quickbook/concepts/graphs.qbk
13 13 or more efficient to define a graph implicitly based on some functions. 14 14 15 15 The Boost.Graph interface does not appear as a single graph concept. Instead it is 16 factored into much smaller p eices. The reason for this is that the purpose of a16 factored into much smaller pieces. The reason for this is that the purpose of a 17 17 concept is to summarize the requirements for particular algorithms. Any one algorithm 18 18 does not need every kind of graph operation, typically only a small subset. Furthermore, 19 19 there are many graph data-structures that can not provide efficient implementations of … … 225 225 [StdUniqueAssociativeContainer], then the graph cannont be a multigraph. 226 226 227 227 [heading Indexed Graphs] 228 Indexed graph provide a specific property, an index, for vertices e, edges or both.229 Many algorithms require vertex or edge indices for "fast" property acces , often228 Indexed graph provide a specific property, an index, for vertices, edges or both. 229 Many algorithms require vertex or edge indices for "fast" property access, often 230 230 declaring exterior properties as `vector`s and using the indices as random access 231 231 iterators to access those properties. These concepts effectively require that 232 232 indices are accessible as interior properties of the graph. 233 233 234 234 These concepts are provided to help describe interface requirements for algorithms 235 235 that allow indices to be provided as an exterior property map. With these concepts, 236 requirements (and interfaces) can be written more disti cntly for algorithms that accept236 requirements (and interfaces) can be written more distinctly for algorithms that accept 237 237 indexed graphs, and those that require adaptation through exterior properties. 238 238 239 239 There are two indexed graph concepts: [VertexIndexGraph] and [EdgeIndexGraph].