OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:vertex2
(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) {
98
DCHECK(vertices_.find(
vertex2
) != 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
207
const Vertex
vertex2
= *it2;
local
208
if (vertex1 >=
vertex2
) {
211
const double weight = graph.EdgeWeight(vertex1,
vertex2
);
212
weighted_edges.push_back(make_pair(weight, make_pair(vertex1,
vertex2
)));
226
const Vertex
vertex2
= edge.second;
local
232
(forest->Neighbors(
vertex2
).size() == 2)) {
241
Vertex root2 = FindConnectedComponent(
vertex2
, &disjoint_set);
249
const double edge_weight = graph.EdgeWeight(vertex1,
vertex2
);
250
forest->AddEdge(vertex1,
vertex2
, edge_weight);
251
forest->AddEdge(
vertex2
, vertex1, edge_weight)
[
all
...]
/external/opencv/cvaux/src/
cvlee.cpp
[
all
...]
Completed in 692 milliseconds