From 2275b3019bd05d48584d8a10ccbd9eeabb7e2dba Mon Sep 17 00:00:00 2001 From: Marshall Clow Date: Tue, 16 Oct 2012 03:35:39 +0000 Subject: [PATCH] Fix typo; Refs #7511 [SVN r80997] --- include/boost/graph/is_kuratowski_subgraph.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/include/boost/graph/is_kuratowski_subgraph.hpp b/include/boost/graph/is_kuratowski_subgraph.hpp index 1dd314d3..d0a2aede 100644 --- a/include/boost/graph/is_kuratowski_subgraph.hpp +++ b/include/boost/graph/is_kuratowski_subgraph.hpp @@ -175,7 +175,7 @@ namespace boost 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