Ticket #7684: fix_comment_typo.patch
File fix_comment_typo.patch, 1.4 KB (added by , 10 years ago) |
---|
-
boost/graph/tiernan_all_cycles.hpp
64 64 // basically modernized it to use real data structures (no more arrays and matrices). 65 65 // Oh... and there's explicit control structures - not just gotos. 66 66 // 67 // The problem is definitely NP-complete, an anunbounded implementation of this67 // The problem is definitely NP-complete, an unbounded implementation of this 68 68 // will probably run for quite a while on a large graph. The conclusions 69 69 // of this paper also reference a Paton algorithm for undirected graphs as being 70 70 // much more efficient (apparently based on spanning trees). Although not implemented, … … 85 85 // } 86 86 87 87 /** 88 * The default cycle visitor provid sean empty visit function for cycle88 * The default cycle visitor provides an empty visit function for cycle 89 89 * visitors. 90 90 */ 91 91 struct cycle_visitor … … 168 168 169 169 // conditions for allowing a traversal along this edge are: 170 170 // 1. the index of v must be greater than that at which the 171 // thepath is rooted (p.front()).171 // path is rooted (p.front()). 172 172 // 2. the vertex v cannot already be in the path 173 173 // 3. the vertex v cannot be closed to the vertex u 174 174