boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-19 04:12:11 +00:00
Code Issues Projects Releases Wiki Activity

Fix minor doc typos (#270)

Browse Source 
* Fix typo in incident doc

* Add missing closing bracket to random_spanning_tree doc
This commit is contained in:
Philip Allgaier
2021-12-09 07:22:10 +01:00
committed by GitHub
parent 8c76c8aa01
commit 972bde3031
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/incident.html
View File

@@ -44,7 +44,7 @@
incident(typename graph_traits<Graph>::edge_descriptor e, Graph& g)
</pre>
This function takes and edge descriptor and returns the pair of
This function takes an edge descriptor and returns the pair of
vertices that are <i>incident</i> to the edge. For directed graphs,
the <tt>first</tt> vertex is the source and the <tt>second</tt> vertex
is the target. This function is equivalent to the expression

2
doc/random_spanning_tree.html
View File

@@ -39,7 +39,7 @@ void random_spanning_tree(const Graph&amp; g, Gen&amp; gen, vertex_descriptor ro
<p>
The <tt>random_spanning_tree()</tt> function generates a random spanning tree
on a directed or undirected graph. The algorithm used is Wilson's algorithm (<a
href="bibliography.html#wilson96generating">73</a>, based on <!-- (FIXME: add
href="bibliography.html#wilson96generating">73</a>), based on <!-- (FIXME: add
documentation for loop_erased_random_walk()) <a
href="loop_erased_random_walk.html"> -->loop-erased random walks<!-- </a> -->. There must
be a path from every non-root vertex of the graph to the root;