|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r67040 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2010-12-05 15:43:48
Author: jewillco
Date: 2010-12-05 15:43:45 EST (Sun, 05 Dec 2010)
New Revision: 67040
URL: http://svn.boost.org/trac/boost/changeset/67040
Log:
Fixed typo
Text files modified:
trunk/libs/graph/doc/fruchterman_reingold.html | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
Modified: trunk/libs/graph/doc/fruchterman_reingold.html
==============================================================================
--- trunk/libs/graph/doc/fruchterman_reingold.html (original)
+++ trunk/libs/graph/doc/fruchterman_reingold.html 2010-12-05 15:43:45 EST (Sun, 05 Dec 2010)
@@ -216,7 +216,7 @@
<H3>Complexity</H3>
<P> The time complexity is <i>O(|V|<sup>2</sup> + |E|)</i> for each
-iteration of the algorithm in the worse case. The average case for the
+iteration of the algorithm in the worst case. The average case for the
grid variant is <i>O(|V| + |E|)</i>. The number of iterations is
determined by the cooling schedule.
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk