| /third_party/boost/libs/graph/test/ |
| D | test_graphs.cpp | 30 typedef undirected_graph< VertexBundle, EdgeBundle, GraphBundle > Graph; in main() typedef
45 typedef directed_graph< VertexBundle, EdgeBundle, GraphBundle > Graph; in main() typedef
63 Graph; in main() typedef
79 Graph; in main() typedef
97 Graph; in main() typedef
115 Graph; in main() typedef
132 Graph; in main() typedef
145 typedef adjacency_matrix< directedS, VertexBundle, EdgeBundle > Graph; in main() typedef
158 typedef labeled_graph< directed_graph<>, unsigned > Graph; in main() typedef
183 Graph; in main() typedef
[all …]
|
| D | adj_list_cc.cpp | 21 Graph; in main() typedef
42 Graph; in main() typedef
64 Graph; in main() typedef
83 Graph; in main() typedef
103 Graph; in main() typedef
125 Graph; in main() typedef
144 Graph; in main() typedef
162 typedef adjacency_list< vecS, vecS, directedS > Graph; in main() typedef
176 typedef adjacency_list< vecS, vecS, bidirectionalS > Graph; in main() typedef
189 typedef adjacency_list< listS, listS, directedS > Graph; in main() typedef
[all …]
|
| D | adj_matrix_cc.cpp | 19 typedef adjacency_matrix< directedS > Graph; in main() typedef
28 typedef adjacency_matrix< undirectedS > Graph; in main() typedef
40 Graph; in main() typedef
60 Graph; in main() typedef
|
| D | filtered_graph_cc.cpp | 22 Graph; in main() typedef
38 Graph; in main() typedef
47 Graph; in main() typedef
|
| D | labeled_graph.cpp | 93 typedef labeled_graph< undirected_graph<>, unsigned > Graph; in test_norm() typedef
100 typedef labeled_graph< directed_graph<>, unsigned > Graph; in test_norm() typedef
113 typedef undirected_graph<> Graph; in test_temp() typedef
132 typedef labeled_graph< undirected_graph< Actor, Movie >, string > Graph; in test_bacon() typedef
143 typedef labeled_graph< directed_graph< Actor, Movie >, string > Graph; in test_bacon() typedef
|
| D | stanford_graph_cc.cpp | 27 typedef Graph* Graph; in main() typedef
41 typedef const Graph* Graph; in main() typedef
|
| D | reverse_graph_cc.cpp | 25 typedef reverse_graph< AdjList > Graph; in main() typedef
46 typedef reverse_graph< AdjList, AdjList& > Graph; in main() typedef
|
| D | dfs.cpp | 41 void initialize_vertex(Vertex u, Graph&) in initialize_vertex() argument
45 template < class Vertex, class Graph > void start_vertex(Vertex u, Graph&) in start_vertex() argument
50 void discover_vertex(Vertex u, Graph&) in discover_vertex() argument
87 template < class Vertex, class Graph > void finish_vertex(Vertex u, Graph&) in finish_vertex() argument
|
| D | subgraph_add.cpp | 35 Graph; in BOOST_AUTO_TEST_CASE() typedef
109 Graph; in BOOST_AUTO_TEST_CASE() typedef
231 Graph; in BOOST_AUTO_TEST_CASE() typedef
|
| /third_party/boost/boost/graph/distributed/ |
| D | vertex_list_adaptor.hpp | 220 source(typename vertex_list_adaptor<Graph, GlobalIndexMap>::edge_descriptor e, in source()
221 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in source()
226 target(typename vertex_list_adaptor<Graph, GlobalIndexMap>::edge_descriptor e, in target()
227 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in target()
234 out_edges(typename vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_descriptor v, in out_edges()
235 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in out_edges()
240 out_degree(typename vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_descriptor v, in out_degree()
241 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in out_degree()
251 in_edges(typename vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_descriptor v, in in_edges()
252 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in in_edges()
[all …]
|
| D | graphviz.hpp | 106 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
191 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
201 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
209 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
222 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
239 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
254 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
267 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) in write_graphviz()
|
| D | filtered_graph.hpp | 38 process_group(filtered_graph<Graph, EdgePredicate, VertexPredicate> const& g) { in process_group()
46 filtered_graph<Graph, EdgePredicate, VertexPredicate> const& g) in vertex()
|
| /third_party/mindspore/mindspore/ccsrc/cxx_api/graph/ |
| D | graph.cc | 21 Graph::Graph() : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
23 Graph::Graph(const std::shared_ptr<GraphData> &graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
25 Graph::Graph(std::shared_ptr<GraphData> &&graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
29 Graph::Graph(std::nullptr_t) : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
|
| /third_party/mindspore/mindspore/lite/src/cxx_api/graph/ |
| D | graph.cc | 22 Graph::Graph() : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
24 Graph::Graph(const std::shared_ptr<GraphData> &graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
26 Graph::Graph(std::shared_ptr<GraphData> &&graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
30 Graph::Graph(std::nullptr_t) : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
|
| /third_party/boost/libs/graph/example/ |
| D | labeled_graph.cpp | 33 typedef labeled_graph< Digraph, unsigned > Graph; in main() typedef
42 typedef labeled_graph< Digraph, string > Graph; in main() typedef
49 typedef labeled_graph< Digraph, string, mapS > Graph; in main() typedef
66 typedef labeled_graph< G, size_t > Graph; in main() typedef
|
| /third_party/boost/boost/graph/ |
| D | overloading.hpp | 37 #define BOOST_GRAPH_ENABLE_IF_MODELS(Graph, Tag, Type) \ argument
43 #define BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, Tag) \ argument
51 #define BOOST_GRAPH_ENABLE_IF_MODELS(Graph, Tag, Type) Type argument
52 #define BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, Tag) argument
|
| D | r_c_shortest_paths.hpp | 72 inline bool operator==( in operator ==()
81 inline bool operator!=( in operator !=()
89 inline bool operator<( in operator <()
98 inline bool operator>( in operator >()
107 inline bool operator<=( in operator <=()
115 inline bool operator>=( in operator >=()
123 inline bool operator<( in operator <()
133 inline bool operator<=( in operator <=()
143 inline bool operator>( in operator >()
153 inline bool operator>=( in operator >=()
|
| D | vertex_and_edge_range.hpp | 91 inline std::pair< VertexIterator, VertexIterator > vertices( in vertices()
100 num_vertices( in num_vertices()
107 inline std::pair< EdgeIterator, EdgeIterator > edges( in edges()
116 num_edges( in num_edges()
125 source(typename vertex_and_edge_range< Graph, VertexIterator, in source()
135 target(typename vertex_and_edge_range< Graph, VertexIterator, in target()
|
| D | connected_components.hpp | 43 template < class Vertex, class Graph > void start_vertex(Vertex, Graph&) in start_vertex() argument
51 void discover_vertex(Vertex u, Graph&) in discover_vertex() argument
68 connected_components(const Graph& g, ComponentMap c, in connected_components()
90 connected_components(const Graph& g, in connected_components()
|
| D | graph_as_tree.hpp | 89 typedef typename GraphAsTree::base_type Graph; typedef
101 typedef typename GraphAsTree::base_type Graph; typedef
122 typename property_map< Graph, Property >::type get( in get()
130 typename property_map< Graph, Property >::const_type get( in get()
141 get(Property p, const graph_as_tree< Graph, P, N, C >& g, const Key& k) in get()
148 void put(Property p, const graph_as_tree< Graph, P, N, C >& g, const Key& k, in put()
|
| D | lookup_edge.hpp | 26 lookup_edge(typename boost::graph_traits< Graph >::vertex_descriptor src, in lookup_edge()
36 lookup_edge(typename boost::graph_traits< Graph >::vertex_descriptor src, in lookup_edge()
|
| D | core_numbers.hpp | 70 void initialize_vertex(Vertex, Graph&) in initialize_vertex() argument
74 template < class Vertex, class Graph > void discover_vertex(Vertex, Graph&) in discover_vertex() argument
78 template < class Vertex, class Graph > void gray_target(Vertex, Graph&) {} in gray_target() argument
80 template < class Vertex, class Graph > void black_target(Vertex, Graph&) {} in black_target() argument
82 template < class Edge, class Graph > void tree_edge(Edge, Graph&) {} in tree_edge() argument
84 template < class Edge, class Graph > void non_tree_edge(Edge, Graph&) {} in non_tree_edge() argument
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | DOTGraphTraitsPass.h | 54 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
96 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
133 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
159 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | algorithm_performance.cpp | 348 distributedS<mpi_process_group> > Graph; in test_csr() typedef
383 distributedS<mpi_process_group> > Graph; in test_csr() typedef
419 distributedS<mpi_process_group> > Graph; in test_csr() typedef
455 distributedS<mpi_process_group> > Graph; in test_csr() typedef
495 directedS, no_property, WeightedEdge> Graph; in test_adjacency_list() typedef
507 undirectedS, no_property, WeightedEdge> Graph; in test_adjacency_list() typedef
556 directedS, no_property, WeightedEdge> Graph; in test_adjacency_list() typedef
568 undirectedS, no_property, WeightedEdge> Graph; in test_adjacency_list() typedef
617 directedS, no_property, WeightedEdge> Graph; in test_adjacency_list() typedef
629 undirectedS, no_property, WeightedEdge> Graph; in test_adjacency_list() typedef
[all …]
|
| D | adjlist_remove_test.cpp | 35 bidirectionalS> Graph; in test_bidirectional_graph() typedef
88 undirectedS> Graph; in test_undirected_graph() typedef
|