Home | History | Annotate | Download | only in src

Lines Matching refs:id2

449 void Graph::addEdge(size_t id1, size_t id2)
452   CV_Assert( doesVertexExist( id2 ) );
454   vertices[id1].neighbors.insert(id2);
455   vertices[id2].neighbors.insert(id1);
458 void Graph::removeEdge(size_t id1, size_t id2)
461   CV_Assert( doesVertexExist( id2 ) );
463   vertices[id1].neighbors.erase(id2);
464   vertices[id2].neighbors.erase(id1);
467 bool Graph::areVerticesAdjacent(size_t id1, size_t id2) const
470   CV_Assert( doesVertexExist( id2 ) );
473   return it->second.neighbors.find(id2) != it->second.neighbors.end();
1276       size_t id2 = static_cast<size_t> (maxLoc.y);
1277       computeShortestPath(predecessorMatrix, id1, id2, path.vertices);