| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/utils/ |
| random_sequence.py | 13 import networkx as nx namespace
53 if nx.is_valid_degree_sequence(seq):
56 raise nx.NetworkXError(\
115 >>> nx.zipf_rv(alpha=2, xmin=3, seed=42) # doctest: +SKIP
186 raise nx.NetworkXError(
|
| decorators.py | 6 import networkx as nx namespace
60 raise nx.NetworkXNotImplemented('not implemented for %s type'%
110 raise nx.NetworkXError( msg.format(f.__name__, package) )
224 raise nx.NetworkXError(msg.format(path_arg))
232 raise nx.NetworkXError(msg)
|
| misc.py | 21 import networkx as nx namespace
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/utils/tests/ |
| test_misc.py | 3 import networkx as nx namespace
20 K=nx.complete_graph(10)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/assortativity/ |
| correlation.py | 4 import networkx as nx namespace
49 >>> G=nx.path_graph(4)
50 >>> r=nx.degree_assortativity_coefficient(G)
116 >>> G=nx.path_graph(4)
117 >>> r=nx.degree_pearson_correlation_coefficient(G)
166 >>> G=nx.Graph()
170 >>> print(nx.attribute_assortativity_coefficient(G,'color'))
212 >>> G=nx.Graph()
216 >>> print(nx.numeric_assortativity_coefficient(G,'size'))
276 nx,ny=M.shape # nx=n
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/bipartite/tests/ |
| test_basic.py | 5 import networkx as nx namespace
10 assert_true(bipartite.is_bipartite(nx.path_graph(4)))
11 assert_true(bipartite.is_bipartite(nx.DiGraph([(1,0)])))
12 assert_false(bipartite.is_bipartite(nx.complete_graph(3)))
16 G=nx.path_graph(4)
20 @raises(nx.NetworkXError)
22 c=bipartite.color(nx.complete_graph(4))
26 G = nx.bipartite_random_graph(10, 10, 0.1, directed=True)
30 G=nx.path_graph(4)
36 G=nx.path_graph(4
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/centrality/ |
| flow_matrix.py | 3 import networkx as nx namespace
134 A = nx.to_scipy_sparse_matrix(G, nodelist=nodelist, weight=weight,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/centrality/tests/ |
| test_load_centrality.py | 3 import networkx as nx namespace
10 G=nx.Graph();
23 self.K = nx.krackhardt_kite_graph()
24 self.P3 = nx.path_graph(3)
25 self.P4 = nx.path_graph(4)
26 self.K5 = nx.complete_graph(5)
28 self.C4=nx.cycle_graph(4)
29 self.T=nx.balanced_tree(r=2, h=2)
30 self.Gb = nx.Graph()
33 self.F = nx.florentine_families_graph(
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/connectivity/tests/ |
| test_connectivity.py | 2 import networkx as nx namespace
8 G = nx.fast_gnp_random_graph(100,0.0575)
9 if nx.is_connected(G) and not nx.is_biconnected(G):
37 G1 = nx.path_graph(3)
39 assert_equal(nx.average_node_connectivity(G1),1)
40 G2 = nx.path_graph(3)
42 assert_equal(nx.average_node_connectivity(G2),2.2)
43 G3 = nx.Graph()
44 assert_equal(nx.average_node_connectivity(G3),0
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/flow/tests/ |
| test_mincost.py | 3 import networkx as nx namespace
8 G = nx.DiGraph()
15 flowCost, H = nx.network_simplex(G)
21 assert_equal(nx.min_cost_flow_cost(G), 24)
23 assert_equal(nx.min_cost_flow(G), soln)
24 assert_equal(nx.cost_of_flow(G, H), 24)
27 G = nx.DiGraph()
36 assert_raises(nx.NetworkXUnbounded, nx.network_simplex, G)
39 G = nx.DiGraph(
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/isomorphism/ |
| isomorphvf2.py | 36 >>> G1 = nx.path_graph(4)
37 >>> G2 = nx.path_graph(4)
51 >>> G1 = nx.path_graph(4, create_using=nx.DiGraph())
52 >>> G2 = nx.path_graph(4, create_using=nx.DiGraph())
82 able to perform the check by making use of nx.line_graph(). For
141 import networkx as nx namespace
164 >>> G1 = nx.path_graph(4)
165 >>> G2 = nx.path_graph(4
[all...] |
| matchhelpers.py | 6 import networkx as nx namespace
92 if nx.utils.is_string_like(attr):
106 if nx.utils.is_string_like(attr):
167 if nx.utils.is_string_like(attr):
183 if nx.utils.is_string_like(attr):
252 if nx.utils.is_string_like(attr):
309 if nx.utils.is_string_like(attr):
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/isomorphism/tests/ |
| test_isomorphvf2.py | 10 import networkx as nx namespace
30 g1 = nx.Graph()
31 g2 = nx.Graph()
45 g1 = nx.Graph()
46 g2 = nx.Graph()
75 graph = nx.Graph()
104 #Atlas = nx.graph_atlas_g()[0:208] # 208, 6 nodes or less
105 Atlas = nx.graph_atlas_g()[0:100]
113 relabel = nx.relabel_nodes(graph, d)
129 for g1 in [nx.MultiGraph(), nx.MultiDiGraph()]
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/shortest_paths/tests/ |
| test_astar.py | 3 import networkx as nx namespace
9 self.XG=nx.DiGraph()
28 G = nx.Graph()
41 path = nx.astar_path(G, points[0], points[-1], dist)
42 assert path == nx.dijkstra_path(G, points[0], points[-1])
45 assert nx.astar_path(self.XG,'s','v')==['s', 'x', 'u', 'v']
46 assert nx.astar_path_length(self.XG,'s','v')==9
49 G=nx.MultiDiGraph(self.XG)
50 assert_raises((TypeError,nx.NetworkXError),
51 nx.astar_path, [G,'s','v']
[all...] |
| test_generic.py | 3 import networkx as nx namespace
9 self.grid=cnlti(nx.grid_2d_graph(4,4),first_label=1,ordering="sorted")
10 self.cycle=nx.cycle_graph(7)
11 self.directed_cycle=nx.cycle_graph(7,create_using=nx.DiGraph())
15 assert_equal(nx.shortest_path(self.cycle,0,3),[0, 1, 2, 3])
16 assert_equal(nx.shortest_path(self.cycle,0,4),[0, 6, 5, 4])
17 assert_equal(nx.shortest_path(self.grid,1,12),[1, 2, 3, 4, 8, 12])
18 assert_equal(nx.shortest_path(self.directed_cycle,0,3),[0, 1, 2, 3])
20 assert_equal(nx.shortest_path(self.cycle,0,3,weight='weight'),[0, 1, 2, 3]
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/drawing/ |
| nx_agraph.py | 10 >>> G=nx.complete_graph(5)
11 >>> A=nx.to_agraph(G)
12 >>> H=nx.from_agraph(A)
27 import networkx as nx namespace
48 >>> K5=nx.complete_graph(5)
49 >>> A=nx.to_agraph(K5)
50 >>> G=nx.from_agraph(A)
51 >>> G=nx.from_agraph(A)
70 create_using=nx.DiGraph()
72 create_using=nx.MultiDiGraph(
[all...] |
| nx_pydot.py | 23 import networkx as nx namespace
58 Use G=nx.Graph(nx.read_dot(path)) to return a Graph instead of a MultiGraph.
85 >>> K5=nx.complete_graph(5)
86 >>> A=nx.to_pydot(K5)
87 >>> G=nx.from_pydot(A) # return MultiGraph
88 >>> G=nx.Graph(nx.from_pydot(A)) # make a Graph instead of MultiGraph
98 create_using=nx.MultiGraph()
100 create_using=nx.Graph(
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/tests/ |
| test_threshold.py | 10 import networkx as nx namespace
14 cnlti = nx.convert_node_labels_to_integers
19 G=nx.star_graph(10)
23 G=nx.complete_graph(10)
33 G=nx.generators.havel_hakimi_graph(deg)
38 G=nx.generators.havel_hakimi_graph(deg)
57 G=nx.generators.havel_hakimi_graph(deg)
62 nx.shortest_path(G, n, m))
72 assert_equal(spld, nx.single_source_shortest_path_length(G, 3))
102 G=nx.Graph({1:[2],2:[3],3:[4],4:[5],5:[6]}
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/tests/ |
| test_gexf.py | 4 import networkx as nx namespace
29 self.simple_directed_graph=nx.DiGraph()
89 self.attribute_graph=nx.DiGraph()
130 self.simple_undirected_graph=nx.Graph()
140 H=nx.read_gexf(self.simple_directed_fh)
150 nx.write_gexf(G,fh)
152 H=nx.read_gexf(fh)
161 H=nx.read_gexf(self.simple_undirected_fh)
170 H=nx.read_gexf(self.attribute_fh)
193 assert_raises(nx.NetworkXError,nx.read_gexf,fh
[all...] |
| test_shp.py | 9 import networkx as nx namespace
62 expected = nx.DiGraph()
64 G = nx.read_shp(self.shppath)
92 G = nx.read_shp(self.shppath)
93 nx.write_shp(G, tpath)
112 G = nx.read_shp(self.shppath)
113 nx.write_shp(G, tpath)
119 G = nx.DiGraph()
132 nx.write_shp(G, tpath)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/testing/tests/ |
| test_utils.py | 2 import networkx as nx namespace
35 G = nx.Graph()
37 H = nx.Graph()
42 G = nx.Graph()
44 H = nx.Graph()
64 G = nx.MultiGraph()
66 H = nx.MultiGraph()
72 G = nx.MultiGraph()
74 H = nx.MultiGraph()
84 G = nx.path_graph(4
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_rem_pio2.c | 59 int32_t e0,i,j,nx,n,ix,hx; local
181 nx = 3;
182 while(tx[nx-1]==zero) nx--; /* skip zero term */
183 n = __kernel_rem_pio2(tx,ty,e0,nx,1);
|
| /external/clang/test/SemaCXX/ |
| namespace-alias.cpp | 116 A::X nx; variable
|
| /external/fdlibm/ |
| e_rem_pio2.c | 92 int e0,i,j,nx,n,ix,hx; local
170 nx = 3;
171 while(tx[nx-1]==zero) nx--; /* skip zero term */
172 n = __kernel_rem_pio2(tx,y,e0,nx,2,two_over_pi);
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/geometry/ |
| Point.java | 89 float nx = this.x; local
92 float ox = nx;
93 nx = ny;
96 return new Point(nx, ny);
|
