Searched refs:p_map (Results 1 – 7 of 7) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | prim_minimum_spanning_tree.hpp | 65 PredecessorMap p_map, const bgl_named_params< P, T, R >& params) in prim_minimum_spanning_tree() argument
69 params.predecessor_map(p_map), in prim_minimum_spanning_tree()
75 const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree() argument
78 predecessor_map(p_map).weight_map(get(edge_weight, g)), in prim_minimum_spanning_tree()
|
| D | cycle_canceling.hpp | 161 std::vector< edge_descriptor > p_map(num_vertices(g)); in cycle_canceling_dispatch1() local
164 make_iterator_property_map(p_map.begin(), in cycle_canceling_dispatch1()
|
| D | dag_shortest_paths.hpp | 87 dummy_property_map p_map; in dag_sp_dispatch2() local
91 choose_param(get_param(params, vertex_predecessor), p_map), vis, in dag_sp_dispatch2()
|
| D | dijkstra_shortest_paths.hpp | 522 dummy_property_map p_map; in dijkstra_dispatch2() local
529 choose_param(get_param(params, vertex_predecessor), p_map), in dijkstra_dispatch2()
|
| /third_party/boost/libs/graph/example/ |
| D | girth.cpp | 63 boost::property_map< Graph*, pred_t >::type p_map; variable
82 p_map[v] = u; in tree_edge()
88 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
136 p_map = get(pred_t(), g); in main()
|
| /third_party/musl/libc-test/src/functionalext/supplement/mman/ |
| D | munmap.c | 35 … char *p_map = mmap(NULL, sizeof(char) * 10, PROT_READ | PROT_WRITE, MAP_SHARED, fileno(fptr), 0); in munmap_0100() local
37 int data = munmap(p_map, sizeof(char) * 10); in munmap_0100()
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | dijkstra_shortest_paths.rst | 69 OUT: ``predecessor_map(PredecessorMap p_map)``
|