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