Home
last modified time | relevance | path

Searched refs:remove_edge (Results 1 – 25 of 33) sorted by relevance

12

/third_party/boost/libs/graph_parallel/test/
Dadjlist_remove_test.cpp65 remove_edge(*out_edges(u, g).first, g); in test_bidirectional_graph()
66 remove_edge(*out_edges(w, g).first, g); in test_bidirectional_graph()
68 remove_edge(*in_edges(v, g).first, g); in test_bidirectional_graph()
69 remove_edge(*in_edges(w, g).first, g); in test_bidirectional_graph()
114 remove_edge(*out_edges(u, g).first, g); in test_undirected_graph()
115 remove_edge(*out_edges(w, g).first, g); in test_undirected_graph()
118 remove_edge(*in_edges(v, g).first, g); in test_undirected_graph()
119 remove_edge(*in_edges(w, g).first, g); in test_undirected_graph()
/third_party/boost/libs/graph/test/
Dtest_destruction.hpp76 remove_edge(e, g); in disconnect_graph()
80 remove_edge(verts[3], verts[2], g); in disconnect_graph()
88 remove_edge(verts[5], verts[0], g); in disconnect_graph()
104 boost::remove_edge(e, g); in disconnect_graph()
Dadj_list_loops.cpp27 remove_edge(u, v, g); in test_graph_nonloop()
43 remove_edge(u, v, g); in test_multigraph_nonloop()
56 remove_edge(v, v, g); in test_graph_loop()
70 remove_edge(v, v, g); in test_multigraph_loop()
Dbidir_remove_edge.cpp32 remove_edge(e, g); in main()
47 remove_edge(e, g); in main()
Dbidir_vec_remove_edge.cpp40 remove_edge(e1, g); in main()
55 remove_edge(e2, g); in main()
Dgraph.cpp246 remove_edge(a, b, g); in main()
290 remove_edge(e, g); in main()
/third_party/boost/boost/graph/
Ddirected_graph.hpp223 void remove_edge(vertex_descriptor u, vertex_descriptor v) in remove_edge() function in boost::directed_graph
241 remove_edge(*j); in remove_edge()
245 void remove_edge(edge_iterator i) { remove_edge(*i); } in remove_edge() function in boost::directed_graph
247 void remove_edge(edge_descriptor e) in remove_edge() function in boost::directed_graph
249 boost::remove_edge(e, m_graph); in remove_edge()
287 remove_edge(*i); in remove_edge_and_renumber_indices()
533 inline void remove_edge(typename DIRECTED_GRAPH::vertex_descriptor u, in remove_edge() function
536 return g.remove_edge(u, v); in remove_edge()
540 inline void remove_edge( in remove_edge() function
543 return g.remove_edge(e); in remove_edge()
[all …]
Dundirected_graph.hpp226 void remove_edge(vertex_descriptor u, vertex_descriptor v) in remove_edge() function in boost::undirected_graph
244 remove_edge(*j); in remove_edge()
248 void remove_edge(edge_iterator i) { remove_edge(*i); } in remove_edge() function in boost::undirected_graph
250 void remove_edge(edge_descriptor e) in remove_edge() function in boost::undirected_graph
252 boost::remove_edge(e, m_graph); in remove_edge()
290 remove_edge(*i); in remove_edge_and_renumber_indices()
549 inline void remove_edge(typename UNDIRECTED_GRAPH::vertex_descriptor u, in remove_edge() function
552 return g.remove_edge(u, v); in remove_edge()
556 inline void remove_edge( in remove_edge() function
559 return g.remove_edge(e); in remove_edge()
[all …]
Dvector_as_graph.hpp227 void remove_edge(typename EdgeList::value_type u, in remove_edge() function
236 void remove_edge(typename detail::val_edge< EdgeList >::type e, in remove_edge() function
296 remove_edge(i, u, g); in clear_vertex()
Dsubgraph.hpp719 remove_edge(u_local, v_local, g.m_graph); in remove_edge_recur_down()
729 remove_edge(u_global, v_global, g.m_graph); in remove_edge_recur_up()
753 remove_edge(found.first, (*i)->m_graph); in children_remove_edge()
760 void remove_edge(typename subgraph< G >::vertex_descriptor u, in remove_edge() function
775 void remove_edge(typename subgraph< G >::edge_descriptor e, subgraph< G >& g) in remove_edge() function
785 remove_edge(e_global, root.m_graph); // kick edge from root in remove_edge()
802 remove_edge(*ep.first, g); in remove_edge_if()
820 remove_edge(*p.first, g); in clear_vertex()
Dleda_graph.hpp495 remove_edge(*ei); in clear_vertex()
500 remove_edge(*iei); in clear_vertex()
536 void remove_edge( in remove_edge() function
549 void remove_edge( in remove_edge() function
647 void remove_edge(graph_traits< leda::graph >::vertex_descriptor u, in remove_edge() function
656 void remove_edge(graph_traits< leda::graph >::edge_descriptor e, leda::graph& g) in remove_edge() function
666 remove_edge(*ei, g); in clear_vertex()
670 remove_edge(*iei, g); in clear_vertex()
Dlabeled_graph.hpp875 inline void remove_edge( in remove_edge() function
878 return remove_edge(e, g.graph()); in remove_edge()
882 inline void remove_edge(typename LABELED_GRAPH::vertex_descriptor u, in remove_edge() function
885 return remove_edge(u, v, g.graph()); in remove_edge()
917 remove_edge(g.vertex(u), g.vertex(v), g.graph()); in remove_edge_by_label()
Dbc_clustering.hpp139 remove_edge(e, g); in betweenness_centrality_clustering()
Dgraph_concepts.hpp282 remove_edge(u, v, g); in BOOST_CONCEPT_USAGE()
283 remove_edge(e, g); in BOOST_CONCEPT_USAGE()
316 remove_edge(iter, g); in BOOST_CONCEPT_USAGE()
Dadjacency_matrix.hpp939 void remove_edge( in remove_edge() function
954 void remove_edge( in remove_edge() function
958 remove_edge(source(e, g), target(e, g), g); in remove_edge()
998 remove_edge(u, *vi, g); in clear_vertex()
1000 remove_edge(*vi, u, g); in clear_vertex()
1013 remove_edge(u, *vi, g); in clear_vertex()
/third_party/skia/src/core/
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge() function
66 remove_edge(edge); in backward_insert_edge_based_on_x()
/third_party/flutter/skia/src/core/
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge() function
66 remove_edge(edge); in backward_insert_edge_based_on_x()
/third_party/boost/libs/graph/example/
Dadjacency_list.cpp93 remove_edge(vertex(1, g), vertex(3, g), g); in main()
98 remove_edge(ei, g); in main()
Dmodify_graph.cpp105 remove_edge(u, v, g); in modify_demo()
118 remove_edge(e, g); in modify_demo()
130 remove_edge(iter, g); in modify_demo()
Dedge_property.cpp160 remove_edge(6, 8, G); in main()
Dgraph.cpp97 remove_edge(a, b, g); in main()
/third_party/boost/boost/graph/detail/
Dadjacency_list.hpp580 inline void remove_edge(typename Config::edge_descriptor e) in remove_edge() function
590 inline void remove_edge(typename Config::out_edge_iterator iter) in remove_edge() function
635 inline void remove_edge(typename Config::vertex_descriptor u, in remove_edge() function
669 inline void remove_edge( in remove_edge() function
672 g_.remove_edge(e_or_iter); in remove_edge()
912 inline void remove_edge(typename Config::edge_descriptor e) in remove_edge() function
922 inline void remove_edge(typename Config::out_edge_iterator iter) in remove_edge() function
924 this->remove_edge(*iter); in remove_edge()
947 inline void remove_edge(EdgeOrIter e, undirected_graph_helper< Config >& g_) in remove_edge() function
952 g_.remove_edge(e); in remove_edge()
[all …]
/third_party/boost/libs/graph_parallel/doc/
Ddistributed_adjacency_list.rst706 remove_edge(vertex_descriptor u, vertex_descriptor v,
719 remove_edge(edge_descriptor e, adjacency_list& g);
730 void remove_edge(out_edge_iterator iter, adjacency_list& g);
732 This has the same effect as ``remove_edge(*iter, g)``. For directed
734 ``remove_edge(*iter, g)``.
749 invoking remove_edge() on each of the removed edges.
764 invoking ``remove_edge()`` on each of the removed edges.
781 of invoking ``remove_edge()`` on each of the removed edges.
820 invoking ``remove_edge()`` for all of the edges that have ``u`` as the source
836 invoking ``remove_edge()`` for all of the edges that have ``u`` as the
[all …]
/third_party/boost/boost/graph/distributed/
Dadjacency_list.hpp998 remove_edge(ei, bg); in remove_in_edge()
2143 if (ei != ei_end) boost::remove_edge(ei, base()); in remove_local_edge()
2185 if (ei != ei_end) boost::remove_edge(ei, base()); in remove_local_edge()
3019 remove_edge(typename PBGL_DISTRIB_ADJLIST_TYPE::edge_descriptor e, in remove_edge() function
3028 remove_edge(e.local, g.base()); in remove_edge()
3041 remove_edge(typename PBGL_DISTRIB_ADJLIST_TYPE::vertex_descriptor u, in remove_edge() function
3048 if (the_edge.second) remove_edge(the_edge.first, g); in remove_edge()
3053 remove_edge(typename PBGL_DISTRIB_ADJLIST_TYPE::out_edge_iterator ei, in remove_edge() function
3056 remove_edge(*ei, g); in remove_edge()
3061 remove_edge(typename PBGL_DISTRIB_ADJLIST_TYPE_CONFIG(directedS) in remove_edge() function
[all …]
/third_party/flutter/skia/src/gpu/
DGrTessellator.cpp889 void remove_edge(Edge* edge, EdgeList* edges) { in remove_edge() function
989 remove_edge(e, activeEdges); in rewind()
1570 remove_edge(e, &activeEdges); in simplify()
1628 remove_edge(e, &activeEdges); in tessellate()
1636 remove_edge(v->fLastEdgeAbove, &activeEdges); in tessellate()
1706 remove_edge(e, &activeEdges); in remove_non_boundary_edges()
1748 remove_edge(prevEdge, boundary); in simplify_boundary()
1749 remove_edge(e, boundary); in simplify_boundary()
1763 remove_edge(prevEdge, boundary); in simplify_boundary()
1764 remove_edge(e, boundary); in simplify_boundary()
[all …]

12