Home
last modified time | relevance | path

Searched refs:WeightMap (Results 1 – 25 of 45) sorted by relevance

12

/third_party/boost/boost/graph/
Dstoer_wagner_min_cut.hpp32 template < typename ParityMap, typename WeightMap, typename IndexMap >
36 typedef typename boost::property_traits< WeightMap >::value_type
42 weight_type& cutweight, const WeightMap& weight_map, in mas_min_cut_visitor()
118 const WeightMap& m_weightMap;
146 template < class UndirectedGraph, class WeightMap, class ParityMap,
149 typename boost::property_traits< WeightMap >::value_type
150 stoer_wagner_min_cut(const UndirectedGraph& g, WeightMap weights, in stoer_wagner_min_cut()
157 typedef typename boost::property_traits< WeightMap >::value_type in stoer_wagner_min_cut()
167 detail::mas_min_cut_visitor< ParityMap, WeightMap, IndexMap > vis( in stoer_wagner_min_cut()
202 template < class UndirectedGraph, class WeightMap, class ParityMap,
[all …]
Dmetric_tsp_approx.hpp93 template < typename VertexListGraph, typename WeightMap,
95 void metric_tsp_approx_tour(VertexListGraph& g, WeightMap w, OutputIterator o) in metric_tsp_approx_tour()
110 template < typename VertexListGraph, typename WeightMap,
114 WeightMap w, OutputIterator o) in metric_tsp_approx_tour_from_vertex()
135 template < typename VertexListGraph, typename WeightMap,
138 VertexListGraph& g, WeightMap w, VertexIndexMap id, TSPVertexVisitor vis) in metric_tsp_approx()
143 template < typename VertexListGraph, typename WeightMap,
147 WeightMap w, TSPVertexVisitor vis) in metric_tsp_approx_from_vertex()
152 template < typename VertexListGraph, typename WeightMap,
156 WeightMap weightmap, VertexIndexMap indexmap, TSPVertexVisitor vis) in metric_tsp_approx_from_vertex()
[all …]
Ddijkstra_shortest_paths.hpp112 template < class UniformCostVisitor, class UpdatableQueue, class WeightMap,
118 typedef typename property_traits< WeightMap >::value_type W;
121 WeightMap w, PredecessorMap p, DistanceMap d, in dijkstra_bfs_visitor()
218 WeightMap m_weight;
327 class PredecessorMap, class DistanceMap, class WeightMap, class IndexMap,
331 DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, in dijkstra_shortest_paths_no_init()
344 class DistanceMap, class WeightMap, class IndexMap, class Compare,
348 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in dijkstra_shortest_paths_no_init()
358 class PredecessorMap, class DistanceMap, class WeightMap, class IndexMap,
362 DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, in dijkstra_shortest_paths_no_init()
[all …]
Drelax.hpp41 template < class Graph, class WeightMap, class PredecessorMap,
44 const WeightMap& w, PredecessorMap& p, DistanceMap& d, in relax()
52 typedef typename property_traits< WeightMap >::value_type W; in relax()
91 template < class Graph, class WeightMap, class PredecessorMap,
94 const Graph& g, const WeightMap& w, PredecessorMap& p, DistanceMap& d, in relax_target()
99 typedef typename property_traits< WeightMap >::value_type W; in relax_target()
122 template < class Graph, class WeightMap, class PredecessorMap,
125 WeightMap w, PredecessorMap p, DistanceMap d) in relax()
Dkamada_kawai_spring_layout.hpp152 typename WeightMap, typename EdgeOrSideLength, typename Done,
158 typename property_traits< WeightMap >::value_type weight_type;
169 const Graph& g, PositionMap position, WeightMap weight, in kamada_kawai_spring_layout_impl()
430 WeightMap weight;
585 typename WeightMap, typename T, bool EdgeOrSideLength, typename Done,
589 WeightMap weight, const Topology& topology, in kamada_kawai_spring_layout()
592 typename property_traits< WeightMap >::value_type spring_constant, in kamada_kawai_spring_layout()
602 PositionMap, WeightMap, in kamada_kawai_spring_layout()
616 typename WeightMap, typename T, bool EdgeOrSideLength, typename Done,
619 WeightMap weight, const Topology& topology, in kamada_kawai_spring_layout()
[all …]
Ddijkstra_shortest_paths_no_color_map.hpp25 typename DistanceMap, typename WeightMap, typename VertexIndexMap,
31 WeightMap weight_map, VertexIndexMap index_map, in dijkstra_shortest_paths_no_color_map_no_init()
130 typename DistanceMap, typename WeightMap, typename VertexIndexMap,
136 WeightMap weight_map, VertexIndexMap index_map, in dijkstra_shortest_paths_no_color_map()
168 template < typename Graph, typename DistanceMap, typename WeightMap,
172 DistanceMap distance_map, WeightMap weight_map, in dijkstra_no_color_map_dispatch2()
196 template < typename Graph, typename DistanceMap, typename WeightMap,
200 DistanceMap distance_map, WeightMap weight_map, IndexMap index_map, in dijkstra_no_color_map_dispatch1()
204 typedef typename property_traits< WeightMap >::value_type DistanceType; in dijkstra_no_color_map_dispatch1()
Dbellman_ford_shortest_paths.hpp90 template < class EdgeListGraph, class Size, class WeightMap,
93 bool bellman_ford_shortest_paths(EdgeListGraph& g, Size N, WeightMap weight, in bellman_ford_shortest_paths()
102 BOOST_CONCEPT_ASSERT((ReadablePropertyMapConcept< WeightMap, Edge >)); in bellman_ford_shortest_paths()
141 typename WeightMap, typename PredecessorMap, typename DistanceMap,
145 Size N, WeightMap weight, PredecessorMap pred, DistanceMap distance, in bellman_dispatch2()
150 typedef typename property_traits< WeightMap >::value_type weight_type; in bellman_dispatch2()
168 typename WeightMap, typename PredecessorMap, typename DistanceMap,
171 WeightMap weight, PredecessorMap pred, DistanceMap distance, in bellman_dispatch2()
184 template < class EdgeListGraph, class Size, class WeightMap,
186 bool bellman_dispatch(EdgeListGraph& g, Size N, WeightMap weight, in bellman_dispatch()
Dmaximum_adjacency_search.hpp115 template < class Graph, class WeightMap, class MASVisitor,
117 void maximum_adjacency_search(const Graph& g, WeightMap weights, in maximum_adjacency_search()
124 typedef typename boost::property_traits< WeightMap >::value_type in maximum_adjacency_search()
211 template < class Graph, class WeightMap, class MASVisitor,
213 void maximum_adjacency_search(const Graph& g, WeightMap weights, MASVisitor vis, in maximum_adjacency_search()
229 (boost::ReadablePropertyMapConcept< WeightMap, edge_descriptor >)); in maximum_adjacency_search()
256 template < typename WeightMap > struct mas_dispatch
262 const ArgPack& params, WeightMap w) in apply()
268 typedef typename WeightMap::value_type weight_type; in apply()
318 WeightMap; in apply() typedef
[all …]
Ddag_shortest_paths.hpp23 class WeightMap, class ColorMap, class PredecessorMap, class Compare,
27 DistanceMap distance, WeightMap weight, ColorMap color, PredecessorMap pred, in dag_shortest_paths()
80 class WeightMap, class ColorMap, class IndexMap, class Params >
83 DistanceMap distance, WeightMap weight, ColorMap color, IndexMap /*id*/, in dag_sp_dispatch2()
101 class WeightMap, class ColorMap, class IndexMap, class Params >
104 DistanceMap distance, WeightMap weight, ColorMap color, IndexMap id, in dag_sp_dispatch1()
107 typedef typename property_traits< WeightMap >::value_type T; in dag_sp_dispatch1()
Dfloyd_warshall_shortest.hpp89 typename WeightMap, typename BinaryPredicate, typename BinaryFunction,
92 DistanceMatrix& d, const WeightMap& w, const BinaryPredicate& compare, in floyd_warshall_all_pairs_shortest_paths()
144 template < class VertexListGraph, class DistanceMatrix, class WeightMap,
147 DistanceMatrix& d, WeightMap /*w*/, in floyd_warshall_init_dispatch() argument
150 typedef typename property_traits< WeightMap >::value_type WM; in floyd_warshall_init_dispatch()
163 class WeightMap, class P, class T, class R >
165 DistanceMatrix& d, WeightMap w, in floyd_warshall_noninit_dispatch()
168 typedef typename property_traits< WeightMap >::value_type WM; in floyd_warshall_noninit_dispatch()
Dbetweenness_centrality.hpp42 template < typename Graph, typename WeightMap, typename IncomingMap,
53 WeightMap weight, IncomingMap incoming, DistanceMap distance, in brandes_dijkstra_visitor()
84 typedef typename property_traits< WeightMap >::value_type in edge_not_relaxed()
108 WeightMap weight;
119 template < typename WeightMap > struct brandes_dijkstra_shortest_paths
121 brandes_dijkstra_shortest_paths(WeightMap weight_map) in brandes_dijkstra_shortest_paths()
136 typedef brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, in operator ()()
150 WeightMap weight_map;
419 typename PathCountMap, typename VertexIndexMap, typename WeightMap >
428 WeightMap weight_map BOOST_GRAPH_ENABLE_IF_MODELS_PARM( in brandes_betweenness_centrality()
[all …]
Dprim_minimum_spanning_tree.hpp49 class DistanceMap, class WeightMap, class IndexMap >
52 PredecessorMap predecessor, DistanceMap distance, WeightMap weight, in prim_minimum_spanning_tree()
55 typedef typename property_traits< WeightMap >::value_type W; in prim_minimum_spanning_tree()
/third_party/boost/libs/graph_parallel/test/
Ddistributed_mst_test.cpp35 template<typename Graph, typename WeightMap, typename InputIterator>
37 total_weight(const Graph& g, WeightMap weight_map, in total_weight()
85 typedef property_map<Graph, edge_weight_t>::type WeightMap; in test_distributed_dense_boruvka() typedef
86 WeightMap weight_map = get(edge_weight, g); in test_distributed_dense_boruvka()
100 typedef property_map<Graph, edge_weight_t>::type WeightMap; in test_distributed_dense_boruvka() typedef
101 WeightMap weight_map = get(edge_weight, g); in test_distributed_dense_boruvka()
116 typedef property_map<Graph, edge_weight_t>::type WeightMap; in test_distributed_dense_boruvka() typedef
117 WeightMap weight_map = get(edge_weight, g); in test_distributed_dense_boruvka()
132 typedef property_map<Graph, edge_weight_t>::type WeightMap; in test_distributed_dense_boruvka() typedef
133 WeightMap weight_map = get(edge_weight, g); in test_distributed_dense_boruvka()
/third_party/boost/boost/graph/distributed/
Ddijkstra_shortest_paths.hpp33 typename WeightMap, typename IndexMap, typename ColorMap,
41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
56 typename WeightMap, typename IndexMap, typename ColorMap,
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
79 typename Lookahead, typename WeightMap, typename IndexMap,
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
103 typename Lookahead, typename WeightMap, typename IndexMap,
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
126 typename Lookahead, typename WeightMap, typename IndexMap,
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
[all …]
Ddehne_gotz_min_spanning_tree.hpp143 template<typename ProcessGroup, typename Graph, typename WeightMap,
147 boruvka_merge_step(ProcessGroup pg, const Graph& g, WeightMap weight_map, in boruvka_merge_step()
160 typedef typename property_traits<WeightMap>::value_type in boruvka_merge_step()
432 typename EdgeList, typename WeightMap, typename GlobalIndexMap,
440 WeightMap weight, in merge_local_minimum_spanning_trees_step()
447 typedef typename property_traits<WeightMap>::value_type weight_type; in merge_local_minimum_spanning_trees_step()
473 indirect_cmp<WeightMap, std::less<weight_type> > cmp_edge_weight(weight); in merge_local_minimum_spanning_trees_step()
536 template<typename Graph, typename WeightMap, typename OutputIterator,
540 dense_boruvka_minimum_spanning_tree(const Graph& g, WeightMap weight_map, in dense_boruvka_minimum_spanning_tree()
599 template<typename Graph, typename WeightMap, typename OutputIterator,
[all …]
Dcrauser_et_al_shortest_paths.hpp425 template<typename Graph, typename MinInWeightMap, typename WeightMap,
429 WeightMap weight, Inf inf, Compare compare, in initialize_min_in_weights()
450 template<typename Graph, typename MinInWeightMap, typename WeightMap,
454 WeightMap weight, Inf inf, Compare compare, in initialize_min_in_weights()
490 template<typename Graph, typename MinInWeightMap, typename WeightMap,
493 initialize_min_in_weights(const Graph&, MinInWeightMap, WeightMap, Inf, in initialize_min_in_weights() argument
505 template<typename Graph, typename MinOutWeightMap, typename WeightMap,
509 WeightMap weight, Compare compare) in initialize_min_out_weights()
511 typedef typename property_traits<WeightMap>::value_type weight_type; in initialize_min_out_weights()
531 typename PredecessorMap, typename DistanceMap, typename WeightMap,
[all …]
Deager_dijkstra_shortest_paths.hpp83 class WeightMap, class PredecessorMap, class DistanceMap,
90 WeightMap w, PredecessorMap p, DistanceMap d, in parallel_dijkstra_bfs_visitor()
141 WeightMap m_weight;
339 typename PredecessorMap, typename DistanceMap, typename WeightMap,
348 WeightMap weight, IndexMap index_map, ColorMap color_map, in eager_dijkstra_shortest_paths()
376 <DijkstraVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, Combine, in eager_dijkstra_shortest_paths()
393 typename PredecessorMap, typename DistanceMap, typename WeightMap>
400 WeightMap weight) in eager_dijkstra_shortest_paths()
/third_party/boost/libs/graph_parallel/doc/
Ddehne_gotz_min_spanning_tree.rst48 IN/OUT: ``WeightMap weight``
108 template<typename Graph, typename WeightMap, typename OutputIterator,
112 dense_boruvka_minimum_spanning_tree(const Graph& g, WeightMap weight_map,
118 template<typename Graph, typename WeightMap, typename OutputIterator,
121 dense_boruvka_minimum_spanning_tree(const Graph& g, WeightMap weight_map,
124 template<typename Graph, typename WeightMap, typename OutputIterator>
126 dense_boruvka_minimum_spanning_tree(const Graph& g, WeightMap weight_map,
179 template<typename Graph, typename WeightMap, typename OutputIterator,
182 merge_local_minimum_spanning_trees(const Graph& g, WeightMap weight,
186 template<typename Graph, typename WeightMap, typename OutputIterator>
[all …]
/third_party/boost/libs/graph/example/
Dastar-cities.cpp67 template < class WeightMap > class time_writer
70 time_writer(WeightMap w) : wm(w) {} in time_writer()
77 WeightMap wm;
126 typedef property_map< mygraph_t, edge_weight_t >::type WeightMap; in main() typedef
177 WeightMap weightmap = get(edge_weight, g); in main()
200 time_writer< WeightMap >(weightmap)); in main()
Dhelper.hpp76 template < typename Graph, typename NameMap, typename WeightMap,
80 read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is) in read_weighted_graph()
111 template < typename Graph, typename WeightMap, typename InputStream >
114 read_weighted_graph(Graph& g, WeightMap wm, InputStream& is) in read_weighted_graph()
/third_party/boost/libs/graph/test/
Dcloseness_centrality.cpp59 typedef constant_property_map< Edge, int > WeightMap; in test_undirected() typedef
71 WeightMap wm(1); in test_undirected()
96 typedef constant_property_map< Edge, int > WeightMap; in test_directed() typedef
108 WeightMap wm(1); in test_directed()
Deccentricity.cpp58 typedef constant_property_map< Edge, int > WeightMap; in test_undirected() typedef
70 WeightMap wm(1); in test_undirected()
99 typedef constant_property_map< Edge, int > WeightMap; in test_directed() typedef
111 WeightMap wm(1); in test_directed()
Dmean_geodesic.cpp60 typedef constant_property_map< Edge, int > WeightMap; in test_undirected() typedef
72 WeightMap wm(1); in test_undirected()
100 typedef constant_property_map< Edge, int > WeightMap; in test_directed() typedef
112 WeightMap wm(1); in test_directed()
Dmetric_tsp_approx.cpp41 typename WeightMap, typename VertexIndexMap >
43 WeightMap wmap, // Property maps passed by value in connectAllEuclidean()
89 typedef property_map< Graph, edge_weight_t >::type WeightMap; in testScalability() typedef
108 WeightMap weight_map(get(edge_weight, g)); in testScalability()
204 typedef property_map< Graph, edge_weight_t >::type WeightMap; in main() typedef
247 WeightMap weight_map(get(edge_weight, g)); in main()
Dread_propmap.cpp25 typedef property_map< graph_t, double EdgeProp::* >::type WeightMap; in main() typedef
28 BOOST_CONCEPT_ASSERT((ReadablePropertyMapConcept< WeightMap, Edge >)); in main()

12