Home
last modified time | relevance | path

Searched refs:d_map (Results 1 – 5 of 5) sorted by relevance

/third_party/boost/libs/graph/example/
Dgirth.cpp60 boost::property_map< Graph*, dist_t >::type d_map; variable
79 k = d_map[u] + 1; in tree_edge()
80 d_map[v] = k; in tree_edge()
87 k = d_map[u] + 1; in non_tree_edge()
88 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
89 girth = d_map[v] + k; in non_tree_edge()
135 d_map = get(dist_t(), g); in main()
141 d_map[*i] = 0; in main()
Ddag_shortest_paths.cpp53 property_map< graph_t, vertex_distance_t >::type d_map in main() local
65 dag_shortest_paths(g, s, d_map, w_map, &color[0], &pred[0], vis, compare, in main()
68 dag_shortest_paths(g, s, distance_map(d_map)); in main()
73 if (d_map[*vi] == (std::numeric_limits< int >::max)()) in main()
76 std::cout << name[*vi] << ": " << d_map[*vi] << '\n'; in main()
/third_party/boost/boost/graph/
Dsuccessive_shortest_path_nonnegative_weights.hpp148 std::vector< D > d_map(num_vertices(g)); in successive_shortest_path_nonnegative_weights_dispatch3() local
152 make_iterator_property_map(d_map.begin(), index)); in successive_shortest_path_nonnegative_weights_dispatch3()
183 std::vector< D > d_map(num_vertices(g)); in successive_shortest_path_nonnegative_weights_dispatch2() local
187 make_iterator_property_map(d_map.begin(), index), in successive_shortest_path_nonnegative_weights_dispatch2()
Dcycle_canceling.hpp135 std::vector< D > d_map(num_vertices(g)); in cycle_canceling_dispatch2() local
138 make_iterator_property_map(d_map.begin(), in cycle_canceling_dispatch2()
/third_party/boost/libs/graph_parallel/doc/
Ddijkstra_shortest_paths.rst77 UTIL/OUT: ``distance_map(DistanceMap d_map)``