| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
| swap.py | 89 G.remove_edge(u,v)
90 G.remove_edge(x,y)
164 G.remove_edge(u,v)
165 G.remove_edge(x,y)
180 G.remove_edge(u,x)
181 G.remove_edge(v,y)
|
| euler.py | 124 g.remove_edge(n,v)
131 g.remove_edge(n,v)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| hybrid.py | 59 G2.remove_edge(prev,w)
68 H.remove_edge(u,v)
103 G2.remove_edge(prev,w)
|
| degree_seq.py | 720 aux_graph.remove_edge(u,v)
|
| random_graphs.py | 419 G.remove_edge(u,v)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/tests/ |
| test_multigraph.py | 103 G.remove_edge(0,0,key='parallel edge')
105 G.remove_edge(0,0)
201 G.remove_edge(0,1)
207 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
208 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,0,2,
237 G.remove_edge(0,1,key='parallel edge')
241 G.remove_edge(0,1)
243 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
|
| test_multidigraph.py | 210 R.remove_edge(1,0)
218 R.remove_edge(1,0)
282 G.remove_edge(0,1)
289 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
290 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,0,2,
297 G.remove_edge(0,1,key='parallel edge')
309 G.remove_edge(0,1)
316 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
|
| historical_tests.py | 146 G.remove_edge('C','A')
158 G.remove_edge('A','A')
210 assert_raises(TypeError,G.remove_edge,'M')
214 G.remove_edge('M','N')
369 DG.remove_edge('A','B')
388 UG.remove_edge('A','B')
|
| test_digraph.py | 172 R.remove_edge(1,0)
180 R.remove_edge(1,0)
247 G.remove_edge(0,1)
250 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
|
| test_graph.py | 177 G.remove_edge(0,0)
206 G.remove_edge(1,2)
574 G.remove_edge(0,1)
576 assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
|
| test_function.py | 96 assert_raises(networkx.NetworkXError, G.remove_edge, 1,2)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/tests/ |
| test_cluster.py | 33 G.remove_edge(1,2)
66 G.remove_edge(1,2)
107 G.remove_edge(1,2)
131 G.remove_edge(1,2)
137 # G.remove_edge(1,2)
|
| test_dag.py | 20 DG.remove_edge(2,3)
40 DG.remove_edge(1,2)
|
| test_matching.py | 95 G.remove_edge(1, 6)
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cfghooks.h | 161 extern void remove_edge (edge);
|
| /external/skia/src/core/ |
| SkScan_Path.cpp | 39 static inline void remove_edge(SkEdge* edge) { function
59 remove_edge(edge);
155 remove_edge(currE);
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/flow/ |
| mincost.py | 458 T.remove_edge(*leavingEdge)
463 forest.remove_edge(*newEdge)
501 H.remove_edge(u, v)
|
| maxflow.py | 143 auxiliary.remove_edge(u, v)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/ |
| multigraph.py | 349 def remove_edge(self, u, v, key=None): member in class:MultiGraph
374 >>> G.remove_edge(0,1)
376 >>> G.remove_edge(*e) # unpacks e from an edge tuple
382 >>> G.remove_edge(1,2) # remove a single (arbitrary) edge
389 >>> G.remove_edge(1,2,key='second')
428 remove_edge : remove a single edge
454 self.remove_edge(*e[:3])
|
| function.py | 178 G.remove_edge=frozen
|
| multidigraph.py | 266 def remove_edge(self, u, v, key=None): member in class:MultiDiGraph
291 >>> G.remove_edge(0,1)
293 >>> G.remove_edge(*e) # unpacks e from an edge tuple
299 >>> G.remove_edge(1,2) # remove a single (arbitrary) edge
306 >>> G.remove_edge(1,2,key='second')
|
| digraph.py | 575 def remove_edge(self, u, v): member in class:DiGraph
596 >>> G.remove_edge(0,1)
598 >>> G.remove_edge(*e) # unpacks e from an edge tuple
600 >>> G.remove_edge(*e[:2]) # select first part of edge tuple
623 remove_edge : remove a single edge
[all...] |
| graph.py | 825 def remove_edge(self, u, v): member in class:Graph
846 >>> G.remove_edge(0,1)
848 >>> G.remove_edge(*e) # unpacks e from an edge tuple
850 >>> G.remove_edge(*e[:2]) # select first part of edge tuple
875 remove_edge : remove a single edge
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/tests/ |
| test_adjlist.py | 190 self.DG.remove_edge('b','a')
191 self.DG.remove_edge('b','c')
|
| /external/skia/src/gpu/ |
| GrTessellatingPathRenderer.cpp | 644 void remove_edge(Edge* edge, EdgeList* edges) {
698 remove_edge(edge, activeEdges);
766 remove_edge(edge, edges);
[all...] |
