# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1507386124 -7200
# Node ID 3ca508482e4c47ce402773e7bb3cf3ab9c62e983
# Parent b79ff94e27d97b2e0cbc1e514a2bdb391407c24a
Change misleading method name in Vf2pp (#597)
It processes an entire connected component of the graph _g1 using BFS,
so processBfsTree() is more appropriate name than processBFSLevel().
diff --git a/lemon/vf2pp.h b/lemon/vf2pp.h
a
|
b
|
|
272 | 272 | } |
273 | 273 | } |
274 | 274 | |
275 | | void processBFSLevel(typename G1::Node source,unsigned int& orderIndex, |
| 275 | void processBfsTree(typename G1::Node source,unsigned int& orderIndex, |
276 | 276 | typename G1::template NodeMap<int>& dm1, |
277 | 277 | typename G1::template NodeMap<bool>& added) { |
278 | 278 | _order[orderIndex]=source; |
… |
… |
|
342 | 342 | _labelTmp1[_intLabels1[minNode]]== |
343 | 343 | _labelTmp1[_intLabels1[n1]]))) |
344 | 344 | minNode=n1; |
345 | | processBFSLevel(minNode,orderIndex,dm1,added); |
| 345 | processBfsTree(minNode,orderIndex,dm1,added); |
346 | 346 | } |
347 | 347 | else |
348 | 348 | ++n; |