Home
last modified time | relevance | path

Searched refs:Digraph (Results 1 – 14 of 14) sorted by relevance

/third_party/boost/libs/graph_parallel/test/
Ddistributed_csr_test.cpp41 Digraph; in concept_checks() typedef
42 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
43 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
45 function_requires< GraphConcept<Digraph> >(); in concept_checks()
46 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
47 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
50 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
53 ReadablePropertyGraphConcept<Digraph, vertex_descriptor, vertex_global_t> in concept_checks()
56 ReadablePropertyGraphConcept<Digraph, vertex_descriptor, vertex_owner_t> in concept_checks()
[all …]
Ddistributed_csr_algorithm_test.cpp220 Digraph; in test_main() typedef
223 typedef sorted_erdos_renyi_iterator<minstd_rand, Digraph> ERIter; in test_main()
224 typedef small_world_iterator<minstd_rand, Digraph> SWIter; in test_main()
225 typedef sorted_rmat_iterator<minstd_rand, Digraph> RMATIter; in test_main()
227 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in test_main()
241 Digraph g(ERIter(gen, n, prob), ERIter(), in test_main()
244 Digraph g2(SWIter(gen, n, k, prob), SWIter(), n); in test_main()
245 Digraph g3(RMATIter(gen, n, size_t(n*n*prob), a, b, c, d), RMATIter(), n); in test_main()
277 typedef property_map<Digraph, vertex_index_t>::type vertex_index_map; in test_main()
/third_party/boost/libs/graph/example/
Dlabeled_graph.cpp30 typedef directed_graph<> Digraph; in main() typedef
33 typedef labeled_graph< Digraph, unsigned > Graph; in main()
42 typedef labeled_graph< Digraph, string > Graph; in main()
49 typedef labeled_graph< Digraph, string, mapS > Graph; in main()
57 typedef labeled_graph< Digraph*, int > TempGraph; in main()
58 Digraph g; in main()
Dgraph-assoc-types.cpp59 template < typename Digraph >
60 void foo(Digraph& digraph, in foo()
61 typename graph_traits< Digraph >::vertex_descriptor u, in foo()
62 typename graph_traits< Digraph >::vertex_descriptor v) in foo()
64 typedef typename graph_traits< Digraph >::edge_descriptor edge_t; in foo()
Dgraphviz.cpp19 Digraph; typedef
/third_party/mindspore/mindspore/ccsrc/debug/
Ddraw.h75 class Digraph : public BaseDigraph {
77 Digraph(const std::string &name, const std::string &filename) : BaseDigraph(name, filename) {} in Digraph() function
78 explicit Digraph(const std::string &name) : BaseDigraph(name) {} in Digraph() function
79 ~Digraph() override;
Ddraw.cc76 gsub = std::make_shared<Digraph>(sub_graph->ToString()); in DrawNodes()
159 digraph = std::make_shared<Digraph>("mindspore", filename); in DrawByOpt()
375 Digraph::~Digraph() { in ~Digraph()
522 void Digraph::Node(const AnfNodePtr &node, int id) { in Node()
559 void Digraph::Edge(const AnfNodePtr &start, const AnfNodePtr &end, int idx, int id_start) { in Edge()
/third_party/boost/libs/graph/test/
Ddegree_centrality.cpp113 typedef directed_graph<> Digraph; in main() typedef
116 test_influence< Digraph >(); in main()
117 test_prestige< Digraph >(); in main()
Dcloseness_centrality.cpp123 typedef directed_graph<> Digraph; in main() typedef
126 test_directed< Digraph >(); in main()
Deccentricity.cpp131 typedef directed_graph<> Digraph; in main() typedef
134 test_directed< Digraph >(); in main()
Dmean_geodesic.cpp131 typedef directed_graph<> Digraph; in main() typedef
134 test_directed< Digraph >(); in main()
Dbetweenness_centrality_test.cpp474 Digraph; in main() typedef
506 run_weighted_test((Digraph*)0, 5, dw_edge_init1, 6, dw_centrality1); in main()
Dfloyd_warshall_test.cpp429 Digraph; in main() typedef
430 Digraph adjlist_digraph; in main()
/third_party/json/
DChangeLog.md1792 - Digraph warning [\#679](https://github.com/nlohmann/json/pull/679) ([traits](https://github.com/t…