Subject: [Boost-commit] svn:boost r81369 - trunk/boost/graph
From: jewillco_at_[hidden]
Date: 2012-11-16 10:30:43
Author: jewillco
Date: 2012-11-16 10:30:42 EST (Fri, 16 Nov 2012)
New Revision: 81369
URL: http://svn.boost.org/trac/boost/changeset/81369
Log:
Applied patch from #7684; fixes #7684
Text files modified:
trunk/boost/graph/tiernan_all_cycles.hpp | 6 +++---
1 files changed, 3 insertions(+), 3 deletions(-)
Modified: trunk/boost/graph/tiernan_all_cycles.hpp
==============================================================================
--- trunk/boost/graph/tiernan_all_cycles.hpp (original)
+++ trunk/boost/graph/tiernan_all_cycles.hpp 2012-11-16 10:30:42 EST (Fri, 16 Nov 2012)
@@ -64,7 +64,7 @@
// basically modernized it to use real data structures (no more arrays and matrices).
// Oh... and there's explicit control structures - not just gotos.
//
-// The problem is definitely NP-complete, an an unbounded implementation of this
+// The problem is definitely NP-complete, an unbounded implementation of this
// will probably run for quite a while on a large graph. The conclusions
// of this paper also reference a Paton algorithm for undirected graphs as being
// much more efficient (apparently based on spanning trees). Although not implemented,
@@ -85,7 +85,7 @@
// }
/**
- * The default cycle visitor providse an empty visit function for cycle
+ * The default cycle visitor provides an empty visit function for cycle
* visitors.
*/
struct cycle_visitor
@@ -168,7 +168,7 @@
// conditions for allowing a traversal along this edge are:
// 1. the index of v must be greater than that at which the
- // the path is rooted (p.front()).
+ // path is rooted (p.front()).
// 2. the vertex v cannot already be in the path
// 3. the vertex v cannot be closed to the vertex u