Home
last modified time | relevance | path

Searched refs:remove_in_edge_if (Results 1 – 8 of 8) sorted by relevance

/third_party/boost/libs/graph_parallel/test/
Ddistributed_adjacency_list_test.cpp124 remove_in_edge_if(*vertices(g1).first, never<Graph1>(), g1); in test_main()
272 remove_in_edge_if(*vertices(g3).first, never<Graph3>(), g3); in test_main()
/third_party/boost/libs/graph/example/
Dmodify_graph.cpp175 remove_in_edge_if(v, name_equals("bar", name_map), g); in modify_demo()
/third_party/boost/boost/graph/
Ddirected_graph.hpp567 inline void remove_in_edge_if(typename DIRECTED_GRAPH::vertex_descriptor v, in remove_in_edge_if() function
570 return remove_in_edge_if(v, pred, g.impl()); in remove_in_edge_if()
Dundirected_graph.hpp591 inline void remove_in_edge_if(typename UNDIRECTED_GRAPH::vertex_descriptor v, in remove_in_edge_if() function
594 return remove_in_edge_if(v, pred, g.impl()); in remove_in_edge_if()
Dgraph_concepts.hpp330 remove_in_edge_if(u, p, g); in BOOST_CONCEPT_USAGE()
/third_party/boost/boost/graph/distributed/
Dadjacency_list.hpp3182 remove_in_edge_if in remove_in_edge_if() function
3199 remove_in_edge_if in remove_in_edge_if() function
3385 remove_in_edge_if(u, parallel::detail::always_true(), g); in clear_in_edges()
/third_party/boost/boost/graph/detail/
Dadjacency_list.hpp987 void remove_in_edge_if(typename Config::vertex_descriptor u, Predicate pred, in remove_in_edge_if() function
1357 inline void remove_in_edge_if(typename Config::vertex_descriptor v, in remove_in_edge_if() function
/third_party/boost/libs/graph_parallel/doc/
Ddistributed_adjacency_list.rst756 void remove_in_edge_if(vertex_descriptor v, Predicate predicate,