| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 123 remove_out_edge_if(*vertices(g1).first, never<Graph1>(), g1); in test_main()
174 remove_out_edge_if(*vertices(g2).first, never<Graph2>(), g2); in test_main()
271 remove_out_edge_if(*vertices(g3).first, never<Graph3>(), g3); in test_main()
|
| /third_party/boost/libs/graph/example/ |
| D | remove_edge_if_dir.cpp | 61 remove_out_edge_if(vertex(0, g), incident_to(vertex(3, g), g), g); in main()
|
| D | remove_edge_if_bidir.cpp | 92 remove_out_edge_if(vertex(0, g), incident_to(vertex(3, g), g), g); in main()
|
| D | remove_edge_if_undir.cpp | 89 remove_out_edge_if(vertex(0, g), incident_on(vertex(3, g), g), g); in main()
|
| D | modify_graph.cpp | 164 remove_out_edge_if(u, name_equals("foo", name_map), g); in modify_demo()
|
| /third_party/boost/boost/graph/ |
| D | undirected_graph.hpp | 580 return remove_out_edge_if(v, pred, g.impl()); in remove_incident_edge_if()
584 inline void remove_out_edge_if(typename UNDIRECTED_GRAPH::vertex_descriptor v, in remove_out_edge_if() function
587 return remove_out_edge_if(v, pred, g.impl()); in remove_out_edge_if()
|
| D | minimum_degree_ordering.hpp | 475 remove_out_edge_if(node, p, G); in eliminate()
507 remove_out_edge_if(v_node, p2, G); in eliminate()
|
| D | directed_graph.hpp | 560 inline void remove_out_edge_if(typename DIRECTED_GRAPH::vertex_descriptor v, in remove_out_edge_if() function
563 return remove_out_edge_if(v, pred, g.impl()); in remove_out_edge_if()
|
| D | graph_concepts.hpp | 317 remove_out_edge_if(u, p, g); in BOOST_CONCEPT_USAGE()
|
| /third_party/boost/boost/graph/distributed/adjlist/ |
| D | redistribute.hpp | 262 remove_out_edge_if(v.local, in redistribute()
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 645 inline void remove_out_edge_if(typename Config::vertex_descriptor u, in remove_out_edge_if() function
665 remove_out_edge_if(*vi, pred, g); in remove_edge_if()
971 void remove_out_edge_if(typename Config::vertex_descriptor u, Predicate pred, in remove_out_edge_if() function
993 remove_out_edge_if(u, pred, g_); in remove_in_edge_if()
1315 inline void remove_out_edge_if(typename Config::vertex_descriptor u, in remove_out_edge_if() function
|
| /third_party/boost/boost/graph/distributed/ |
| D | adjacency_list.hpp | 3122 remove_out_edge_if in remove_out_edge_if() function
3132 remove_out_edge_if(u.local, Pred(g, predicate), g.base()); in remove_out_edge_if()
3205 remove_out_edge_if(u, predicate, g); in remove_in_edge_if()
3345 remove_out_edge_if(u, parallel::detail::always_true(), g); in clear_vertex()
3370 remove_out_edge_if(u, parallel::detail::always_true(), g); in clear_out_edges()
|
| /third_party/boost/libs/graph/doc/ |
| D | minimum_degree_ordering.w | 208 remove_out_edge_if(node, p, G);
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | distributed_adjacency_list.rst | 741 void remove_out_edge_if(vertex_descriptor u, Predicate predicate,
|