| /third_party/boost/boost/graph/distributed/ |
| D | delta_stepping_shortest_paths.hpp | 70 typename EdgeWeightMap>
74 typedef typename property_traits<EdgeWeightMap>::value_type Dist;
97 EdgeWeightMap weight,
103 EdgeWeightMap weight);
137 EdgeWeightMap weight;
165 typename EdgeWeightMap>
166 delta_stepping_impl<Graph, PredecessorMap, DistanceMap, EdgeWeightMap>::
170 EdgeWeightMap weight, in delta_stepping_impl()
185 typename EdgeWeightMap>
186 delta_stepping_impl<Graph, PredecessorMap, DistanceMap, EdgeWeightMap>::
[all …]
|
| D | betweenness_centrality.hpp | 144 typename EdgeWeightMap, typename PathCountMap
155 typedef typename property_traits<EdgeWeightMap>::value_type Dist;
182 EdgeWeightMap weight,
220 EdgeWeightMap weight;
253 typename EdgeWeightMap, typename PathCountMap
259 Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap
267 EdgeWeightMap weight, in betweenness_centrality_delta_stepping_impl()
291 typename EdgeWeightMap, typename PathCountMap
298 Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap
516 typename EdgeWeightMap, typename PathCountMap
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | filtered_graph.cpp | 28 template < typename EdgeWeightMap > struct positive_edge_weight
31 positive_edge_weight(EdgeWeightMap weight) : m_weight(weight) {} in positive_edge_weight()
36 EdgeWeightMap m_weight;
46 typedef property_map< Graph, edge_weight_t >::type EdgeWeightMap; in main() typedef
66 positive_edge_weight< EdgeWeightMap > filter(get(edge_weight, g)); in main()
67 filtered_graph< Graph, positive_edge_weight< EdgeWeightMap > > fg( in main()
|
| D | filtered_graph_edge_range.cpp | 28 template < typename EdgeWeightMap > struct positive_edge_weight
31 positive_edge_weight(EdgeWeightMap weight) : m_weight(weight) {} in positive_edge_weight()
36 EdgeWeightMap m_weight;
46 typedef property_map< Graph, edge_weight_t >::type EdgeWeightMap; in main() typedef
68 EdgeWeightMap weight = get(edge_weight, g); in main()
76 positive_edge_weight< EdgeWeightMap > filter(weight); in main()
77 typedef filtered_graph< Graph, positive_edge_weight< EdgeWeightMap > > in main()
|
| /third_party/boost/boost/graph/ |
| D | gursoy_atun_layout.hpp | 96 template < typename EdgeWeightMap > struct gursoy_shortest
103 EdgeWeightMap weight) in run()
134 typename EdgeWeightMap >
138 EdgeWeightMap weight) in gursoy_atun_step()
190 typedef detail::gursoy_shortest< EdgeWeightMap > shortest; in gursoy_atun_step()
201 typename PositionMap, typename VertexIndexMap, typename EdgeWeightMap >
206 VertexIndexMap vertex_index_map, EdgeWeightMap weight) in gursoy_atun_refine()
245 typename PositionMap, typename VertexIndexMap, typename EdgeWeightMap >
250 VertexIndexMap vertex_index_map, EdgeWeightMap weight) in gursoy_atun_layout()
|
| D | core_numbers.hpp | 128 template < typename Graph, typename CoreMap, typename EdgeWeightMap >
129 void compute_in_degree_map(Graph& g, CoreMap d, EdgeWeightMap wm) in compute_in_degree_map()
147 template < typename Graph, typename CoreMap, typename EdgeWeightMap,
150 Graph& g, CoreMap c, EdgeWeightMap wm, MutableQueue& Q, Visitor vis) in core_numbers_impl()
181 template < typename Graph, typename CoreMap, typename EdgeWeightMap,
184 Graph& g, CoreMap c, EdgeWeightMap wm, IndexMap im, CoreNumVisitor vis) in core_numbers_dispatch()
338 template < typename Graph, typename CoreMap, typename EdgeWeightMap,
341 CoreMap c, EdgeWeightMap wm, VertexIndexMap vim, CoreNumVisitor vis) in core_numbers()
|
| D | howard_cycle_ratio.hpp | 587 typename EdgeWeightMap, typename EdgeIndexMap >
589 VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, in maximum_cycle_mean()
594 typename property_traits< EdgeWeightMap >::value_type >::type Weight; in maximum_cycle_mean()
600 template < typename Graph, typename VertexIndexMap, typename EdgeWeightMap,
603 EdgeWeightMap ewm, EdgeIndexMap eim, in maximum_cycle_mean()
612 typename EdgeWeightMap, typename EdgeIndexMap >
614 VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, in minimum_cycle_mean()
619 typename property_traits< EdgeWeightMap >::value_type >::type Weight; in minimum_cycle_mean()
625 template < typename Graph, typename VertexIndexMap, typename EdgeWeightMap,
628 EdgeWeightMap ewm, EdgeIndexMap eim, in minimum_cycle_mean()
|
| /third_party/boost/libs/graph/test/ |
| D | metric_tsp_approx.cpp | 138 typedef map< Edge, double > EdgeWeightMap; in checkAdjList() typedef
140 typedef associative_property_map< EdgeWeightMap > EWeightPropertyMap; in checkAdjList()
144 EdgeWeightMap w_map; in checkAdjList()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | ssca.cpp | 553 template <typename EdgeWeightMap>
555 typedef typename property_traits<EdgeWeightMap>::value_type weight_type;
558 edge_weight_not_divisible_by_eight(EdgeWeightMap weight) : m_weight(weight) { } in edge_weight_not_divisible_by_eight()
564 EdgeWeightMap m_weight;
972 typedef typename property_map<Graph, weight_type WeightedEdge::*>::type EdgeWeightMap; in run_distributed_graph_tests() typedef
973 edge_weight_not_divisible_by_eight<EdgeWeightMap> filter(get(&WeightedEdge::weight, g)); in run_distributed_graph_tests()
975 typedef typename property_map<Graph, edge_weight_t>::type EdgeWeightMap; in run_distributed_graph_tests() typedef
976 edge_weight_not_divisible_by_eight<EdgeWeightMap> filter(get(edge_weight, g)); in run_distributed_graph_tests()
979 typedef filtered_graph<const Graph, edge_weight_not_divisible_by_eight<EdgeWeightMap> > in run_distributed_graph_tests()
|
| D | algorithm_performance.cpp | 169 template <typename Graph, typename EdgeWeightMap>
170 void test_directed_csr_only_algorithms(const Graph& g, EdgeWeightMap weight, in test_directed_csr_only_algorithms()
172 typename property_traits<EdgeWeightMap>::value_type C) in test_directed_csr_only_algorithms()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| D | SampleProfile.cpp | 174 using EdgeWeightMap = DenseMap<Edge, uint64_t>; typedef
371 EdgeWeightMap EdgeWeights;
|