Lines Matching refs:Graph
429 Graph::Graph(size_t n)
437 bool Graph::doesVertexExist(size_t id) const
442 void Graph::addVertex(size_t id)
449 void Graph::addEdge(size_t id1, size_t id2)
458 void Graph::removeEdge(size_t id1, size_t id2)
467 bool Graph::areVerticesAdjacent(size_t id1, size_t id2) const
476 size_t Graph::getVerticesCount() const
481 size_t Graph::getDegree(size_t id) const
489 void Graph::floydWarshall(cv::Mat &distanceMatrix, int infinity) const
528 const Graph::Neighbors& Graph::getNeighbors(size_t id) const
583 Graph rng(0);
586 std::vector<Graph> basisGraphs;
595 Graph rng(0);
599 std::vector<Graph> basisGraphs;
616 void CirclesGridFinder::rng2gridGraph(Graph &rng, std::vector<cv::Point2f> &vectors) const
620 Graph::Neighbors neighbors1 = rng.getNeighbors(i);
621 for (Graph::Neighbors::iterator it1 = neighbors1.begin(); it1 != neighbors1.end(); it1++)
623 Graph::Neighbors neighbors2 = rng.getNeighbors(*it1);
624 for (Graph::Neighbors::iterator it2 = neighbors2.begin(); it2 != neighbors2.end(); it2++)
642 void CirclesGridFinder::eraseUsedGraph(std::vector<Graph> &basisGraphs) const
757 void CirclesGridFinder::findMCS(const std::vector<Point2f> &basis, std::vector<Graph> &basisGraphs)
1006 float CirclesGridFinder::computeGraphConfidence(const std::vector<Graph> &basisGraphs, bool addRow,
1052 void CirclesGridFinder::addHolesByGraph(const std::vector<Graph> &basisGraphs, bool addRow, Point2f basisVec)
1087 void CirclesGridFinder::findBasis(const std::vector<Point2f> &samples, std::vector<Point2f> &basis, std::vector<Graph> &basisGraphs)
1142 basisGraphs.resize(basis.size(), Graph(keypoints.size()));
1165 void CirclesGridFinder::computeRNG(Graph &rng, std::vector<cv::Point2f> &vectors, Mat *drawImage) const
1167 rng = Graph(keypoints.size());
1245 size_t CirclesGridFinder::findLongestPath(std::vector<Graph> &basisGraphs, Path &bestPath)
1254 const Graph &g = basisGraphs[graphIdx];
1323 void CirclesGridFinder::drawBasisGraphs(const std::vector<Graph> &basisGraphs, Mat &drawImage, bool drawEdges,
