| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_csr_test.cpp | 39 typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property, in concept_checks()
85 typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property, in test_main()
|
| D | algorithm_performance.cpp | 347 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge, no_property, in test_csr()
359 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge> in test_csr()
382 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge, no_property, in test_csr()
395 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge> in test_csr()
418 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge, no_property, in test_csr()
430 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge> in test_csr()
454 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge, no_property, in test_csr()
466 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge> in test_csr()
495 directedS, no_property, WeightedEdge> Graph; in test_adjacency_list()
507 undirectedS, no_property, WeightedEdge> Graph; in test_adjacency_list()
[all …]
|
| D | distributed_connected_components_test.cpp | 73 typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property, in test_distributed_connected_components()
138 no_property, in test_distributed_connected_components()
140 no_property > Graph2; in test_distributed_connected_components()
|
| D | distributed_betweenness_centrality_test.cpp | 115 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge, in test_main()
116 no_property, distributedS<mpi_process_group> > in test_main()
118 typedef compressed_sparse_row_graph<directedS, no_property, WeightedEdge> in test_main()
124 no_property, in test_main()
127 typedef adjacency_list<vecS, vecS, directedS, no_property, in test_main()
|
| D | distributed_strong_components_test.cpp | 70 typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property, in test_distributed_strong_components()
|
| /third_party/boost/libs/graph/example/ |
| D | adjacency_list_io.cpp | 75 typedef adjacency_list< vecS, listS, directedS, no_property, no_property >
99 readFile21 >> read(g21, no_property(), no_property()); in main()
101 << write(g21, no_property(), no_property()) << std::endl; in main()
|
| D | two_graphs_common_spanning_trees.cpp | 21 boost::no_property, // VertexProperties
22 boost::no_property, // EdgeProperties
23 boost::no_property, // GraphProperties
|
| D | adj_list_ra_edgelist.cpp | 17 typedef adjacency_list< vecS, vecS, bidirectionalS, no_property, in main()
18 property< int, edge_weight_t >, no_property, vecS > in main()
|
| D | edge_coloring.cpp | 39 typedef adjacency_list< vecS, vecS, undirectedS, no_property, size_t, in main()
40 no_property > in main()
|
| D | undirected_adjacency_list.cpp | 105 typedef adjacency_list< vecS, vecS, undirectedS, no_property, Weight > in main()
107 typedef adjacency_list< vecS, vecS, directedS, no_property, Weight > in main()
|
| D | undirected_graph.cpp | 13 typedef boost::undirected_graph< boost::no_property > Graph;
|
| /third_party/boost/boost/pending/ |
| D | property_serialize.hpp | 17 inline void serialize(Archive&, no_property&, const unsigned int) in serialize() argument
87 template <> struct is_mpi_datatype< boost::no_property > : mpl::true_
94 BOOST_IS_BITWISE_SERIALIZABLE(boost::no_property)
95 BOOST_CLASS_IMPLEMENTATION(boost::no_property, object_serializable)
96 BOOST_CLASS_TRACKING(boost::no_property, track_never)
|
| D | property.hpp | 19 struct no_property struct
23 template < class Tag, class T, class Base = no_property > struct property
261 template <> struct has_property< no_property > : boost::mpl::false_
296 struct is_no_property : mpl::bool_< is_same< T, no_property >::value >
|
| /third_party/boost/boost/graph/detail/ |
| D | indexed_properties.hpp | 39 typedef no_property vertex_property_type;
121 typedef no_property vertex_property_type;
146 typedef no_property edge_property_type;
237 : public boost::iterator_facade< dummy_no_property_iterator, no_property,
240 mutable no_property prop;
241 no_property& dereference() const { return prop; } in dereference()
260 typedef no_property edge_property_type;
267 void write_by_index(std::size_t /*idx*/, const no_property& /*prop*/) {} in write_by_index() argument
|
| /third_party/boost/boost/graph/parallel/detail/ |
| D | property_holders.hpp | 51 struct maybe_store_property<no_property>
54 maybe_store_property(no_property) {} in maybe_store_property()
56 no_property get_property() const { return no_property(); } in get_property()
105 struct is_mpi_datatype<boost::detail::parallel::maybe_store_property<no_property> > : mpl::true_ { …
118 BOOST_IS_BITWISE_SERIALIZABLE(boost::detail::parallel::maybe_store_property<no_property>)
|
| /third_party/boost/libs/graph/test/ |
| D | adj_list_edge_list_set.cpp | 15 typedef adjacency_list< vecS, vecS, undirectedS, no_property, no_property,
16 no_property, setS >
|
| D | filtered_graph_cc.cpp | 20 typedef adjacency_list< vecS, vecS, directedS, no_property, in main()
36 typedef adjacency_list< vecS, vecS, bidirectionalS, no_property, in main()
45 typedef adjacency_list< vecS, vecS, undirectedS, no_property, in main()
|
| D | bidir_vec_remove_edge.cpp | 23 boost::bidirectionalS, boost::no_property, edge_prop, in main()
24 boost::no_property, boost::vecS > in main()
|
| D | two_graphs_common_spanning_trees_test.cpp | 28 boost::no_property, // VertexProperties
29 boost::no_property, // EdgeProperties
30 boost::no_property, // GraphProperties
|
| D | read_propmap.cpp | 22 typedef adjacency_list< vecS, vecS, directedS, no_property, EdgeProp > graph_t;
|
| D | subgraph_add.cpp | 33 typedef subgraph< adjacency_list< vecS, vecS, directedS, no_property, in BOOST_AUTO_TEST_CASE()
107 typedef subgraph< adjacency_list< vecS, vecS, directedS, no_property, in BOOST_AUTO_TEST_CASE()
229 typedef subgraph< adjacency_list< vecS, vecS, directedS, no_property, in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/boost/graph/ |
| D | adjacency_list_io.hpp | 50 std::istream& in, property< Tag, Value, no_property >& p) in operator >>()
56 inline std::istream& operator>>(std::istream& in, no_property&) { return in; } in operator >>() argument
87 const property< Stag, Svalue, no_property >& s) in getSubset()
92 inline void getSubset(no_property&, const no_property&) {} in getSubset() argument
97 template < typename T > void getSubset(T&, const no_property&) {} in getSubset() argument
263 template < class Graph > struct PropertyPrinter< Graph, no_property >
332 struct GraphPrinter< Graph, no_property, E > : public EdgePrinter< Graph, E >
|
| D | graph_traits.hpp | 305 detail::get_graph_property_type< G >, no_property >
311 detail::get_edge_property_type< G >, no_property >
317 detail::get_vertex_property_type< G >, no_property >
369 struct is_no_bundle : mpl::bool_< is_same< T, no_property >::value >
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | scalable_rmat_generator.rst | 85 typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property,
|
| D | sorted_unique_rmat_generator.rst | 92 typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property,
|