Home
last modified time | relevance | path

Searched refs:EdgeVector (Results 1 – 4 of 4) sorted by relevance

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
DMaximumSpanningTree.h69 MaximumSpanningTree(EdgeWeights &EdgeVector) { in MaximumSpanningTree() argument
70 llvm::stable_sort(EdgeVector, EdgeWeightCompare()); in MaximumSpanningTree()
76 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(), in MaximumSpanningTree()
77 EWe = EdgeVector.end(); EWi != EWe; ++EWi) { in MaximumSpanningTree()
85 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(), in MaximumSpanningTree()
86 EWe = EdgeVector.end(); EWi != EWe; ++EWi) { in MaximumSpanningTree()
/third_party/boost/libs/graph_parallel/test/
Dssca.cpp277 typename EdgeVector>
279 const WeightMap& weight_map, EdgeVector& S) in seq_classify_sets()
310 typename EdgeVector>
313 ColorMap color_map, const EdgeVector& S, in subgraph_extraction()
338 EdgeVector sources(S.begin(), S.end()); in subgraph_extraction()
414 typename DistanceMap, typename ColorMap, typename EdgeVector>
417 ColorMap color_map, const EdgeVector& S, in seq_subgraph_extraction()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h171 using EdgeVector = std::vector<EdgeEntry>; variable
173 EdgeVector Edges;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ExecutionEngine/JITLink/
DJITLink.h169 using EdgeVector = std::vector<Edge>;
170 using edge_iterator = EdgeVector::iterator;
171 using const_edge_iterator = EdgeVector::const_iterator;