| /third_party/boost/libs/graph/test/ |
| D | csr_graph_test.cpp | 209 assert_graphs_equal(g, boost::identity_property_map(), g2, in graph_test()
210 boost::identity_property_map(), boost::identity_property_map()); in graph_test()
222 assert_graphs_equal(g2, boost::identity_property_map(), g3, in graph_test()
223 boost::identity_property_map(), boost::identity_property_map()); in graph_test()
240 assert_graphs_equal(g2, boost::identity_property_map(), g3a, in graph_test()
241 boost::identity_property_map(), boost::identity_property_map()); in graph_test()
257 assert_graphs_equal(g2, boost::identity_property_map(), g3a, in graph_test()
258 boost::identity_property_map(), boost::identity_property_map()); in graph_test()
288 assert_graphs_equal(g2, boost::identity_property_map(), g3a, in graph_test()
289 boost::identity_property_map(), boost::identity_property_map()); in graph_test()
[all …]
|
| D | disjoint_set_test.cpp | 62 typedef disjoint_sets_with_storage< identity_property_map, in main()
63 identity_property_map, find_with_path_halving > in main()
68 typedef disjoint_sets_with_storage< identity_property_map, in main()
69 identity_property_map, find_with_full_path_compression > in main()
|
| /third_party/boost/libs/disjoint_sets/test/ |
| D | disjoint_set_test.cpp | 65 disjoint_sets_with_storage<identity_property_map, identity_property_map, in test_main()
71 disjoint_sets_with_storage<identity_property_map, identity_property_map, in test_main()
|
| /third_party/boost/boost/graph/ |
| D | properties.hpp | 170 typedef identity_property_map type;
171 typedef identity_property_map const_type;
178 typedef identity_property_map type;
179 typedef identity_property_map const_type;
313 inline iterator_property_map< RandomAccessIterator, identity_property_map,
318 return make_iterator_property_map(iter, identity_property_map()); in make_iterator_vertex_map()
335 identity_property_map, typename RandomAccessContainer::value_type,
|
| D | vector_as_graph.hpp | 316 typedef identity_property_map type;
321 identity_property_map get( in get()
324 return identity_property_map(); in get()
328 identity_property_map get(vertex_index_t, std::vector< EdgeList, Allocator >&) in get()
330 return identity_property_map(); in get()
|
| D | one_bit_color_map.hpp | 42 template < typename IndexMap = identity_property_map > struct one_bit_color_map
|
| D | two_bit_color_map.hpp | 44 template < typename IndexMap = identity_property_map > struct two_bit_color_map
|
| D | sequential_vertex_coloring.hpp | 120 make_iterator_property_map(order.begin(), identity_property_map(), in sequential_vertex_coloring()
|
| D | incremental_components.hpp | 144 build_index_lists(parent_start, boost::identity_property_map()); in component_index()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_property_map_test.cpp | 108 identity_property_map> LocalPropertyMap; in colored_test()
109 LocalPropertyMap local_colors(color_vec.begin(), identity_property_map()); in colored_test()
193 identity_property_map> LocalPropertyMap; in bool_test()
194 LocalPropertyMap local_values(bool_vec.begin(), identity_property_map()); in bool_test()
278 identity_property_map> LocalPropertyMap; in string_test()
279 LocalPropertyMap local_strings(string_vec.begin(), identity_property_map()); in string_test()
|
| /third_party/boost/boost/mpi/ |
| D | graph_communicator.hpp | 485 inline identity_property_map get(vertex_index_t, const graph_communicator&) in get()
487 return identity_property_map(); in get()
566 typedef identity_property_map type;
567 typedef identity_property_map const_type;
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | bucket_sort.hpp | 32 typename PropertyMapWrapper = identity_property_map >
113 bucket_sort(begin, end, identity_property_map()); in bucket_sort()
|
| /third_party/boost/libs/graph/example/ |
| D | iterator-property-map-eg.cpp | 15 iterator_property_map< double*, identity_property_map, double, double& > in main()
|
| D | topo-sort2.cpp | 36 vertex_index_map(identity_property_map())); in main()
|
| D | topo-sort1.cpp | 36 vertex_index_map(identity_property_map())); in main()
|
| D | put-get-helper-eg.cpp | 55 boost::identity_property_map > in main()
|
| D | components_on_edgelist.cpp | 66 print_edges(g, identity_property_map()); in main()
|
| D | bucket_sorter.cpp | 32 typedef boost::identity_property_map ID; in main()
|
| D | read_write_dimacs-eg.cpp | 128 g, capacity, identity_property_map(), s, t, std::cout); in main()
|
| D | implicit_graph.cpp | 440 boost::identity_property_map get(boost::vertex_index_t, const ring_graph&) in get()
444 return boost::identity_property_map(); in get()
|
| /third_party/boost/boost/pending/ |
| D | disjoint_sets.hpp | 121 template < class ID = identity_property_map,
122 class InverseID = identity_property_map,
|
| D | fibonacci_heap.hpp | 28 class ID = identity_property_map >
41 size_type n, const Compare& cmp, const ID& id = identity_property_map()) in fibonacci_heap()
|
| D | mutable_queue.hpp | 42 class ID = identity_property_map >
|
| /third_party/boost/boost/property_map/ |
| D | vector_property_map.hpp | 19 template<typename T, typename IndexMap = identity_property_map>
|
| /third_party/boost/libs/property_map/test/ |
| D | property_map_cc.cpp | 100 typedef identity_property_map PMap; in main()
|