Subject: [Boost-commit] svn:boost r80997 - trunk/boost/graph
From: marshall_at_[hidden]
Date: 2012-10-15 23:35:40
Author: marshall
Date: 2012-10-15 23:35:39 EDT (Mon, 15 Oct 2012)
New Revision: 80997
URL: http://svn.boost.org/trac/boost/changeset/80997
Log:
Fix typo; Refs #7511
Text files modified:
trunk/boost/graph/is_kuratowski_subgraph.hpp | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
Modified: trunk/boost/graph/is_kuratowski_subgraph.hpp
==============================================================================
--- trunk/boost/graph/is_kuratowski_subgraph.hpp (original)
+++ trunk/boost/graph/is_kuratowski_subgraph.hpp 2012-10-15 23:35:39 EDT (Mon, 15 Oct 2012)
@@ -175,7 +175,7 @@
while (neighbors[v].size() > 0 && neighbors[v].size() < max_size)
{
- // Find one of v's neighbors u such that that v and u
+ // Find one of v's neighbors u such that v and u
// have no neighbors in common. We'll look for such a
// neighbor with a naive cubic-time algorithm since the
// max size of any of the neighbor sets we'll consider