HomeSort by relevance Sort by last modified time
    Searched defs:nx (Results 226 - 250 of 280) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/tests/
historical_tests.py 5 import networkx as nx namespace
12 self.null=nx.null_graph()
13 self.P1=cnlti(nx.path_graph(1),first_label=1)
14 self.P3=cnlti(nx.path_graph(3),first_label=1)
15 self.P10=cnlti(nx.path_graph(10),first_label=1)
16 self.K1=cnlti(nx.complete_graph(1),first_label=1)
17 self.K3=cnlti(nx.complete_graph(3),first_label=1)
18 self.K4=cnlti(nx.complete_graph(4),first_label=1)
19 self.K5=cnlti(nx.complete_graph(5),first_label=1)
20 self.K10=cnlti(nx.complete_graph(10),first_label=1
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/drawing/
nx_pylab.py 22 import networkx as nx namespace
69 >>> G=nx.dodecahedral_graph()
70 >>> nx.draw(G)
71 >>> nx.draw(G,pos=nx.spring_layout(G)) # use spring layout
93 >>> import networkx as nx
94 >>> G=nx.dodecahedral_graph()
95 >>> nx.draw(G) # networkx draw()
230 >>> G=nx.dodecahedral_graph()
231 >>> nx.draw(G
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/
random_graphs.py 18 import networkx as nx namespace
88 return nx.gnp_random_graph(n,p,directed=directed)
95 G=nx.DiGraph(G)
153 G=nx.DiGraph()
155 G=nx.Graph()
258 G=nx.DiGraph()
260 G=nx.Graph()
326 raise nx.NetworkXError("k>=n, choose smaller k or larger n")
393 raise nx.NetworkXError("k>=n, choose smaller k or larger n")
397 G = nx.Graph(
    [all...]
small.py 38 import networkx as nx namespace
70 >>> G=nx.make_small_graph(["adjacencylist","C_4",4,[[2,4],[1,3],[2,4],[1,3]]])
74 >>> G=nx.make_small_graph(["adjacencylist","C_4",4,[[2,4],[3],[4],[]]])
81 >>> G=nx.make_small_graph(["edgelist","C_4",4,[[1,2],[3,4],[2,3],[4,1]]])
136 >>> G=nx.LCF_graph(6,[3,-3],3)
140 >>> G=nx.LCF_graph(14,[5,-5],7)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/
gml.py 35 import networkx as nx namespace
80 >>> G=nx.path_graph(4)
81 >>> nx.write_gml(G,'test.gml')
82 >>> H=nx.read_gml('test.gml')
158 G=nx.MultiDiGraph()
160 G=nx.MultiGraph()
180 G=nx.DiGraph(G)
182 G=nx.Graph(G)
192 G=nx.relabel_nodes(G,dict(mapping))
383 >>> G=nx.path_graph(4
    [all...]
gexf.py 28 import networkx as nx namespace
59 >>> G=nx.path_graph(4)
60 >>> nx.write_gexf(G, "test.gexf")
97 >>> G=nx.path_graph(4)
99 >>> s=linefeed.join(nx.generate_gexf(G)) # doctest: +SKIP
100 >>> for line in nx.generate_gexf(G): # doctest: +SKIP
225 raise nx.NetworkXError('Unknown GEXF version %s'%version)
574 raise nx.NetworkXError("No <graph> element in GEXF file")
585 G=nx.MultiDiGraph()
587 G=nx.MultiGraph(
    [all...]
graphml.py 44 import networkx as nx namespace
73 >>> G=nx.path_graph(4)
74 >>> nx.write_graphml(G, "test.graphml")
99 >>> G=nx.path_graph(4)
101 >>> s=linefeed.join(nx.generate_graphml(G)) # doctest: +SKIP
102 >>> for line in nx.generate_graphml(G): # doctest: +SKIP
177 >>> G=nx.path_graph(4)
179 >>> s=linefeed.join(nx.generate_graphml(G))
180 >>> H=nx.parse_graphml(s)
284 raise nx.NetworkXError('GraphML writer does not support
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/tests/
test_convert_numpy.py 4 import networkx as nx namespace
21 self.G2 = cycle_graph(10, create_using=nx.DiGraph())
23 self.G3 = self.create_weighted(nx.Graph())
24 self.G4 = self.create_weighted(nx.DiGraph())
41 GG = nx.from_numpy_matrix(A, create_using=create_using)
43 GW = nx.to_networkx_graph(A, create_using=create_using)
51 assert_raises(nx.NetworkXError, nx.from_numpy_matrix, A)
55 A = nx.to_numpy_matrix(self.G1)
56 self.identity_conversion(self.G1, A, nx.Graph()
    [all...]
test_convert_scipy.py 4 import networkx as nx namespace
21 self.G2 = cycle_graph(10, create_using=nx.DiGraph())
23 self.G3 = self.create_weighted(nx.Graph())
24 self.G4 = self.create_weighted(nx.DiGraph())
41 GG = nx.from_scipy_sparse_matrix(A, create_using=create_using)
44 GW = nx.to_networkx_graph(A, create_using=create_using)
73 assert_raises(nx.NetworkXError, nx.from_scipy_sparse_matrix, A)
77 A = nx.to_scipy_sparse_matrix(self.G1)
78 self.identity_conversion(self.G1, A, nx.Graph()
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/utils/tests/
test_decorators.py 6 import networkx as nx namespace
13 test1(nx.Graph())
20 test1(nx.Graph())
22 @raises(nx.NetworkXNotImplemented)
27 test1(nx.Graph())
41 assert_raises(nx.NetworkXError, test2)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/setools/
dta.py 23 import networkx as nx namespace
62 self.G = nx.DiGraph()
111 yield self.__generate_steps(nx.shortest_path(self.subG, s, t))
147 for path in nx.all_simple_paths(self.subG, s, t, maxlen):
179 for path in nx.all_shortest_paths(self.subG, s, t):
  /external/mesa3d/src/gallium/drivers/nv30/
nv30_transfer.c 572 unsigned nx = rect->w >> k; local
579 m += ((ty * nx) + tx) << k << k;
  /external/opencv/cv/src/
cvcamshift.cpp 97 int dx, dy, nx, ny; local
111 nx = cur_rect.x + dx;
114 if( nx < 0 )
115 nx = 0;
116 else if( nx + cur_rect.width > mat->cols )
117 nx = mat->cols - cur_rect.width;
124 dx = nx - cur_rect.x;
126 cur_rect.x = nx;
cvcontourtree.cpp 599 double x13, y13, x12, y12, l_base, nx, ny, qq; local
610 nx = y13 / l_base;
613 *h = nx * x12 + ny * y12;
617 *b = nx * y12 - ny * x12;
  /frameworks/base/core/java/android/text/method/
Touch.java 163 int nx = widget.getScrollX() + (int) dx; local
176 scrollTo(widget, layout, nx, ny);
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/
digraph.py 9 import networkx as nx namespace
54 >>> G = nx.DiGraph()
69 >>> H=nx.Graph()
107 >>> G = nx.DiGraph(day="Friday")
187 >>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc
188 >>> G = nx.Graph(name='my graph')
190 >>> G = nx.Graph(e)
194 >>> G=nx.Graph(e, day="Friday")
235 >>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc
238 >>> K3 = nx.Graph([(0,1),(1,2),(2,0)]
    [all...]
graph.py 17 import networkx as nx namespace
62 >>> G = nx.Graph()
77 >>> H=nx.Graph()
115 >>> G = nx.Graph(day="Friday")
197 >>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc
198 >>> G = nx.Graph(name='my graph')
200 >>> G = nx.Graph(e)
204 >>> G=nx.Graph(e, day="Friday")
236 >>> G = nx.Graph(name='foo')
252 >>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, et
    [all...]
  /external/deqp/modules/gles2/accuracy/
es2aVaryingInterpolationTests.cpp 58 static inline float projectedTriInterpolate (const tcu::Vec3& s, const tcu::Vec3& w, float nx, float ny)
60 return (s[0]*(1.0f-nx-ny)/w[0] + s[1]*ny/w[1] + s[2]*nx/w[2]) / ((1.0f-nx-ny)/w[0] + ny/w[1] + nx/w[2]);
79 float nx = wx / dstW; local
82 int triNdx = nx + ny >= 1.0f ? 1 : 0;
83 float triNx = triNdx ? 1.0f - nx : nx;
  /external/deqp/modules/gles3/accuracy/
es3aVaryingInterpolationTests.cpp 61 static inline float projectedTriInterpolate (const tcu::Vec3& s, const tcu::Vec3& w, float nx, float ny)
63 return (s[0]*(1.0f-nx-ny)/w[0] + s[1]*ny/w[1] + s[2]*nx/w[2]) / ((1.0f-nx-ny)/w[0] + ny/w[1] + nx/w[2]);
82 float nx = wx / dstW; local
85 int triNdx = nx + ny >= 1.0f ? 1 : 0;
86 float triNx = triNdx ? 1.0f - nx : nx;
  /external/mesa3d/src/gallium/drivers/nv50/
nv50_surface.c 223 unsigned nx = util_format_get_nblocksx(src->format, src_box->width); local
231 nv50_m2mf_transfer_rect(nv50, &drect, &srect, nx, ny);
  /external/mesa3d/src/gallium/drivers/nvc0/
nvc0_surface.c 230 unsigned nx = util_format_get_nblocksx(src->format, src_box->width); local
238 nvc0->m2mf_copy_rect(nvc0, &drect, &srect, nx, ny);
    [all...]
  /external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11gears/
d3d11gears.cpp 73 vertex(float x, float y, float z, float nx, float ny, float nz)
78 normal[0] = nx;
84 #define VERT(x, y, z) vertices.push_back(vertex((x), (y), (z), (nx), (ny), (nz)))
91 float nx, ny, nz; local
126 nx = 0.0f;
190 nx = -dy / len;
210 nx = -dc[i];
  /external/mesa3d/src/gallium/tests/trivial/
compute.c 193 int nx = (target == PIPE_BUFFER ? (w / dx) : local
214 for (x = 0; x < nx; ++x) {
237 int nx = (tex->target == PIPE_BUFFER ? (tex->width0 / dx) : local
259 for (x = 0; x < nx; ++x) {
    [all...]
  /external/v8/src/
scanner.cc 740 int nx = x * 8 + d; local
741 if (nx >= 256) break;
742 x = nx;
    [all...]
  /frameworks/base/core/java/android/gesture/
GestureUtils.java 299 float nx = lstPointX + ratio * deltaX; local
301 vector[index] = nx;
305 lstPointX = nx;

Completed in 790 milliseconds

1 2 3 4 5 6 7 8 91011>>