| /third_party/boost/libs/graph/example/ |
| D | filtered-copy-example.cpp | 63 clear_vertex(b, G); in main()
64 clear_vertex(d, G); in main()
|
| D | graph.cpp | 143 clear_vertex(c, g); in main()
|
| D | gerdemann.cpp | 62 clear_vertex(v, g); in merge_vertex()
|
| D | modify_graph.cpp | 186 clear_vertex(u, g); in modify_demo()
|
| /third_party/boost/boost/graph/ |
| D | directed_graph.hpp | 181 void clear_vertex(vertex_descriptor v) in clear_vertex() function in boost::directed_graph
184 boost::clear_vertex(v, m_graph); in clear_vertex()
502 inline void clear_vertex( in clear_vertex() function
505 return g.clear_vertex(v); in clear_vertex()
|
| D | undirected_graph.hpp | 182 void clear_vertex(vertex_descriptor v) in clear_vertex() function in boost::undirected_graph
187 boost::clear_vertex(v, m_graph); in clear_vertex()
518 inline void clear_vertex( in clear_vertex() function
521 return g.clear_vertex(v); in clear_vertex()
|
| D | vector_as_graph.hpp | 291 void clear_vertex( in clear_vertex() function
304 clear_vertex(u, g); in remove_vertex()
|
| D | page_rank.hpp | 167 clear_vertex(v, g); in remove_dangling_links()
|
| D | labeled_graph.hpp | 868 inline void clear_vertex( in clear_vertex() function
871 return clear_vertex(v, g.graph()); in clear_vertex()
910 clear_vertex(g.vertex(l), g.graph()); in clear_vertex_by_label()
|
| D | leda_graph.hpp | 488 void clear_vertex( in clear_vertex() function
661 void clear_vertex( in clear_vertex() function
|
| D | graph_concepts.hpp | 284 clear_vertex(v, g); in BOOST_CONCEPT_USAGE()
|
| D | adjacency_matrix.hpp | 991 void clear_vertex( in clear_vertex() function
1005 void clear_vertex( in clear_vertex() function
|
| D | subgraph.hpp | 812 void clear_vertex(typename subgraph< G >::vertex_descriptor v, subgraph< G >& g) in clear_vertex() function
|
| /third_party/boost/libs/graph/test/ |
| D | test_destruction.hpp | 84 clear_vertex(verts[0], g); in disconnect_graph()
|
| D | biconnected_components_test.cpp | 46 clear_vertex(victim, g_copy); in check_articulation_points()
|
| D | graph.cpp | 479 clear_vertex(c, g); in main()
|
| D | graph_test.hpp | 333 clear_vertex(v, g); in test_clear_vertex()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 127 clear_vertex(*vertices(g1).first, g1); in test_main()
276 clear_vertex(*vertices(g3).first, g3); in test_main()
|
| /third_party/boost/boost/graph/distributed/ |
| D | page_rank.hpp | 211 clear_vertex(v, g); in remove_dangling_links()
|
| D | adjacency_list.hpp | 3329 clear_vertex in clear_vertex() function
3340 clear_vertex in clear_vertex() function
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | distributed_adjacency_list.rst | 814 void clear_vertex(vertex_descriptor u, adjacency_list& g);
840 ``clear_vertex()`` instead).
865 removed. One way to make sure of this is to invoke ``clear_vertex()``
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 678 inline void clear_vertex( in clear_vertex() function
1039 inline void clear_vertex( in clear_vertex() function
1409 inline void clear_vertex(typename Config::vertex_descriptor u, in clear_vertex() function
|