diff options
Diffstat (limited to 'boost/graph/tiernan_all_cycles.hpp')
| -rw-r--r-- | boost/graph/tiernan_all_cycles.hpp | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/boost/graph/tiernan_all_cycles.hpp b/boost/graph/tiernan_all_cycles.hpp index 2e7ebc97cd..d4527d5523 100644 --- a/boost/graph/tiernan_all_cycles.hpp +++ b/boost/graph/tiernan_all_cycles.hpp @@ -64,7 +64,7 @@ namespace boost // 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 @@ namespace boost // } /** - * 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 @@ namespace detail // 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 @@ -212,7 +212,6 @@ namespace detail { BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> )); typedef typename graph_traits<Graph>::vertex_descriptor Vertex; - typedef typename graph_traits<Graph>::edge_descriptor Edge; typedef typename graph_traits<Graph>::out_edge_iterator OutIterator; // get the current vertex |