[Boost-commit] svn:boost r80188 - trunk/libs/graph/doc

Subject: [Boost-commit] svn:boost r80188 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2012-08-24 23:09:27

Author: jewillco
Date: 2012-08-24 23:09:27 EDT (Fri, 24 Aug 2012)
New Revision: 80188
URL: http://svn.boost.org/trac/boost/changeset/80188

Log:
Fixed typo
Text files modified: 
   trunk/libs/graph/doc/sorted_erdos_renyi_gen.html |     2 +-                                      
   1 files changed, 1 insertions(+), 1 deletions(-)

Modified: trunk/libs/graph/doc/sorted_erdos_renyi_gen.html
==============================================================================
--- trunk/libs/graph/doc/sorted_erdos_renyi_gen.html	(original)
+++ trunk/libs/graph/doc/sorted_erdos_renyi_gen.html	2012-08-24 23:09:27 EDT (Fri, 24 Aug 2012)
@@ -63,7 +63,7 @@
 href="adjacency_list.html"><tt>adjacency_list</tt></a> or other graph
 structure with iterator-based initialization. An Erd&ouml;s-Renyi
 graph <em>G = (n, p)</em> is a graph with <em>n</em> vertices
-that. The probability of having an edge <em>(u, v)</em> in <em>G</em>
+such that the probability of having an edge <em>(u, v)</em> in <em>G</em>
 is <em>p</em> for any vertices <em>u</em> and <em>v</em>. Typically,
 there are no self-loops, but the generator can optionally introduce
 self-loops with probability <em>p</em>.</p>