HomeSort by relevance Sort by last modified time
    Searched full:vertex1 (Results 1 - 3 of 3) sorted by null

  /external/ceres-solver/internal/ceres/
graph.h 90 // Add a weighted edge between the vertex1 and vertex2. Calling
96 void AddEdge(const Vertex& vertex1, const Vertex& vertex2, double weight) {
97 DCHECK(vertices_.find(vertex1) != vertices_.end());
100 if (edges_[vertex1].insert(vertex2).second) {
101 edges_[vertex2].insert(vertex1);
104 if (vertex1 < vertex2) {
105 edge_weights_[make_pair(vertex1, vertex2)] = weight;
107 edge_weights_[make_pair(vertex2, vertex1)] = weight;
112 void AddEdge(const Vertex& vertex1, const Vertex& vertex2) {
113 AddEdge(vertex1, vertex2, 1.0)
    [all...]
graph_algorithms.h 199 const Vertex vertex1 = *it; local
200 forest->AddVertex(vertex1, graph.VertexWeight(vertex1));
201 disjoint_set[vertex1] = vertex1;
203 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1);
208 if (vertex1 >= vertex2) {
211 const double weight = graph.EdgeWeight(vertex1, vertex2);
212 weighted_edges.push_back(make_pair(weight, make_pair(vertex1, vertex2)));
225 const Vertex vertex1 = edge.first local
    [all...]
  /external/opencv/cvaux/src/
cvlee.cpp     [all...]

Completed in 257 milliseconds