Home
last modified time | relevance | path

Searched refs:GraphEdge (Results 1 – 6 of 6) sorted by relevance

/external/opencv3/modules/stitching/include/opencv2/stitching/detail/
Dutil.hpp122 struct CV_EXPORTS GraphEdge struct
124 GraphEdge(int from, int to, float weight);
125 bool operator <(const GraphEdge& other) const { return weight < other.weight; } in operator <() argument
126 bool operator >(const GraphEdge& other) const { return weight > other.weight; } in operator >() argument
132 inline GraphEdge::GraphEdge(int _from, int _to, float _weight) : from(_from), to(_to), weight(_weig… in GraphEdge() function in cv::detail::GraphEdge
139 void create(int num_vertices) { edges_.assign(num_vertices, std::list<GraphEdge>()); } in create()
146 std::vector< std::list<GraphEdge> > edges_;
Dutil_inl.hpp60 std::list<GraphEdge>::const_iterator edge = edges_[i].begin(); in forEach()
82 std::list<GraphEdge>::const_iterator edge = edges_[vertex].begin(); in walkBreadthFirst()
/external/opencv3/modules/cudaimgproc/src/
Dmssegmentation.cpp75 struct GraphEdge struct
77 GraphEdge() {} in GraphEdge() function
78 GraphEdge(int to_, int next_, const T& val_) : to(to_), next(next_), val(val_) {} in GraphEdge() function
89 typedef GraphEdge<T> Edge;
/external/opencv3/modules/stitching/src/
Dmotion_estimators.cpp55 void operator ()(const GraphEdge &edge) { dists[edge.to] = dists[edge.from] + 1; } in operator ()()
65 void operator ()(const GraphEdge &edge) in operator ()()
816 std::vector<GraphEdge> edges; in findMaxSpanningTree()
827 edges.push_back(GraphEdge(i, j, conf)); in findMaxSpanningTree()
836 sort(edges.begin(), edges.end(), std::greater<GraphEdge>()); in findMaxSpanningTree()
Dutil.cpp97 edges_[from].push_back(GraphEdge(from, to, weight)); in addEdge()
/external/owasp/sanitizer/tools/findbugs/lib/
Dfindbugs.jarMETA-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd ...