Searched defs:printing_dfs_visitor (Results 1 – 2 of 2) sorted by relevance
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_dfs_test.cpp | 42 struct printing_dfs_visitor struct
45 void initialize_vertex(Vertex v, const Graph& g) in initialize_vertex()
51 void start_vertex(Vertex v, const Graph& g) in start_vertex()
57 void discover_vertex(Vertex v, const Graph& g) in discover_vertex()
63 void examine_edge(Edge e, const Graph& g) in examine_edge()
69 void tree_edge(Edge e, const Graph& g) in tree_edge()
75 void back_edge(Edge e, const Graph& g) in back_edge()
81 void forward_or_cross_edge(Edge e, const Graph& g) in forward_or_cross_edge()
87 void finish_vertex(Vertex v, const Graph& g) in finish_vertex()
94 void vertex_event(const char* name, Vertex v, const Graph& g) in vertex_event()
[all …]
|
| D | distributed_csr_algorithm_test.cpp | 113 struct printing_dfs_visitor struct
116 void initialize_vertex(Vertex v, const Graph& g) in initialize_vertex()
122 void start_vertex(Vertex v, const Graph& g) in start_vertex()
128 void discover_vertex(Vertex v, const Graph& g) in discover_vertex()
134 void examine_edge(Edge e, const Graph& g) in examine_edge()
140 void tree_edge(Edge e, const Graph& g) in tree_edge()
146 void back_edge(Edge e, const Graph& g) in back_edge()
152 void forward_or_cross_edge(Edge e, const Graph& g) in forward_or_cross_edge()
158 void finish_vertex(Vertex v, const Graph& g) in finish_vertex()
165 void vertex_event(const char* name, Vertex v, const Graph& g) in vertex_event()
[all …]
|