Ticket #7511: fix_comment_typo.patch
File fix_comment_typo.patch, 706 bytes (added by , 10 years ago) |
---|
-
boost/graph/is_kuratowski_subgraph.hpp
175 175 176 176 while (neighbors[v].size() > 0 && neighbors[v].size() < max_size) 177 177 { 178 // Find one of v's neighbors u such that thatv and u178 // Find one of v's neighbors u such that v and u 179 179 // have no neighbors in common. We'll look for such a 180 180 // neighbor with a naive cubic-time algorithm since the 181 181 // max size of any of the neighbor sets we'll consider