Searched refs:potentialEdges (Results 1 – 1 of 1) sorted by relevance
114 Cycle findClosestPlanarCycle(QSet<KeyEdge*> & potentialEdges, in findClosestPlanarCycle() argument117 while(!potentialEdges.isEmpty()) in findClosestPlanarCycle()124 foreach(KeyEdge * e, potentialEdges) in findClosestPlanarCycle()151 potentialEdges.remove(closestPotentialEdge); in findClosestPlanarCycle()164 int maxIter = 2 * potentialEdges.size() + 2; in findClosestPlanarCycle()172 if(!potentialEdges.contains(h.edge)) in findClosestPlanarCycle()196 potentialEdges.remove(he.edge); in findClosestPlanarCycle()210 potentialEdges.remove(he.edge); in findClosestPlanarCycle()