| /dports/math/igraph/igraph-0.9.5/src/constructors/ |
| H A D | regular.c | 100 VECTOR(edges)[2 * i + 1] = i; in igraph_star() local
109 VECTOR(edges)[4 * i + 1] = i; in igraph_star() local
110 VECTOR(edges)[4 * i + 2] = i; in igraph_star() local
115 VECTOR(edges)[4 * i - 3] = i; in igraph_star() local
116 VECTOR(edges)[4 * i - 2] = i; in igraph_star() local
122 VECTOR(edges)[2 * i] = i; in igraph_star() local
451 igraph_vector_t edges; in igraph_extended_chordal_ring() local
468 VECTOR(edges)[epos++] = i; in igraph_extended_chordal_ring() local
469 VECTOR(edges)[epos++] = i + 1; in igraph_extended_chordal_ring() local
471 VECTOR(edges)[epos++] = nodes - 1; in igraph_extended_chordal_ring() local
[all …]
|
| H A D | adjacency.c | 198 igraph_vector_t edges = IGRAPH_VECTOR_NULL; in igraph_adjacency() local
272 igraph_vector_t *edges, in igraph_i_weighted_adjacency_directed()
299 igraph_vector_t *edges, in igraph_i_weighted_adjacency_plus()
329 igraph_vector_t *edges, in igraph_i_weighted_adjacency_max()
359 igraph_vector_t *edges, in igraph_i_weighted_adjacency_upper()
385 igraph_vector_t *edges, in igraph_i_weighted_adjacency_lower()
411 igraph_vector_t *edges, in igraph_i_weighted_adjacency_min()
509 igraph_vector_t edges = IGRAPH_VECTOR_NULL; in igraph_weighted_adjacency() local
616 igraph_vector_t edges; in igraph_adjlist() local
665 VECTOR(edges)[edgeptr++] = i; in igraph_adjlist() local
[all …]
|
| H A D | prufer.c | 55 igraph_vector_t edges; in igraph_from_prufer() local
87 VECTOR(edges)[ec++] = v; in igraph_from_prufer() local
88 VECTOR(edges)[ec++] = u; in igraph_from_prufer() local
109 VECTOR(edges)[ec++] = v; in igraph_from_prufer() local
110 VECTOR(edges)[ec++] = u; in igraph_from_prufer() local
|
| H A D | lcf.c | 50 igraph_vector_t edges; in igraph_lcf_vector() local
64 VECTOR(edges)[ptr++] = i; in igraph_lcf_vector() local
65 VECTOR(edges)[ptr++] = i + 1; in igraph_lcf_vector() local
67 VECTOR(edges)[ptr - 1] = 0; in igraph_lcf_vector() local
75 VECTOR(edges)[ptr++] = from; in igraph_lcf_vector() local
76 VECTOR(edges)[ptr++] = to; in igraph_lcf_vector() local
|
| H A D | full.c | 66 igraph_vector_t edges = IGRAPH_VECTOR_NULL; in igraph_full() local
139 igraph_vector_t edges; in igraph_full_citation() local
145 VECTOR(edges)[ptr++] = i; in igraph_full_citation() local
146 VECTOR(edges)[ptr++] = j; in igraph_full_citation() local
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | structure_generators.c | 1141 igraph_vector_t edges; in igraph_full_citation() local
1196 igraph_vector_t edges; in igraph_small() local
1253 igraph_vector_t edges; in igraph_extended_chordal_ring() local
1341 igraph_vector_t edges; in igraph_connect_neighborhood() local
1475 igraph_vector_t edges; in igraph_de_bruijn() local
1555 igraph_vector_t edges; in igraph_kautz() local
1699 igraph_vector_t edges; in igraph_lcf_vector() local
2023 igraph_vector_t edges; in igraph_i_famous() local
2305 igraph_vector_t edges; in igraph_adjlist() local
2402 igraph_vector_t edges; in igraph_from_prufer() local
[all …]
|
| H A D | degree_sequence.cpp | 99 VECTOR(*edges)[2 * (ec + i)] = vd.vertex; in igraph_i_havel_hakimi() local
108 VECTOR(*edges)[2 * (ec + i)] = vd.vertex; in igraph_i_havel_hakimi() local
109 VECTOR(*edges)[2 * (ec + i) + 1] = vertices[i].vertex; in igraph_i_havel_hakimi() local
160 VECTOR(*edges)[2 * (ec + k)] = vd.vertex; in igraph_i_havel_hakimi_index() local
161 VECTOR(*edges)[2 * (ec + k) + 1] = it->vertex; in igraph_i_havel_hakimi_index() local
238 VECTOR(*edges)[2 * (ec + k)] = vdp->vertex; in igraph_i_kleitman_wang() local
239 VECTOR(*edges)[2 * (ec + k) + 1] = it->vertex; in igraph_i_kleitman_wang() local
298 VECTOR(*edges)[2 * (ec + k)] = vd.vertex; in igraph_i_kleitman_wang_index() local
299 VECTOR(*edges)[2 * (ec + k) + 1] = it->vertex; in igraph_i_kleitman_wang_index() local
333 igraph_vector_t edges; in igraph_i_realize_undirected_degree_sequence() local
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/classes/ |
| H A D | filters.py | 29 def hide_diedges(edges): argument
34 def hide_edges(edges): argument
39 def hide_multidiedges(edges): argument
44 def hide_multiedges(edges): argument
58 def show_diedges(edges): argument
63 def show_edges(edges): argument
68 def show_multidiedges(edges): argument
73 def show_multiedges(edges): argument
|
| /dports/math/igraph/igraph-0.9.5/src/misc/ |
| H A D | degree_sequence.cpp | 108 VECTOR(*edges)[2 * (ec + i)] = vd.vertex; in igraph_i_havel_hakimi() local
169 VECTOR(*edges)[2 * (ec + k)] = vd.vertex; in igraph_i_havel_hakimi_index() local
249 VECTOR(*edges)[2*ec] = w.vertex; in igraph_i_realize_undirected_multi() local
250 VECTOR(*edges)[2*ec+1] = w.vertex; in igraph_i_realize_undirected_multi() local
273 VECTOR(*edges)[2*ec] = u->vertex; in igraph_i_realize_undirected_multi() local
274 VECTOR(*edges)[2*ec+1] = v->vertex; in igraph_i_realize_undirected_multi() local
336 VECTOR(*edges)[2*ec] = vd.vertex; in igraph_i_realize_undirected_multi_index() local
337 VECTOR(*edges)[2*ec+1] = uit->vertex; in igraph_i_realize_undirected_multi_index() local
485 VECTOR(*edges)[2 * (ec + k)] = vd.vertex; in igraph_i_kleitman_wang_index() local
526 igraph_vector_t edges; in igraph_i_realize_undirected_degree_sequence() local
[all …]
|
| /dports/math/R-cran-igraph/igraph/tests/testthat/ |
| H A D | test_indexing.R | 154 expect_that(g[1,2, edges=TRUE], equals(1)) globalVar
168 expect_that(g['a','b', edges=TRUE], equals(1)) globalVar
188 expect_that(g[[2, directed=FALSE, edges=TRUE]], globalVar
191 expect_that(g[[1:3, , edges=TRUE]], globalVar
193 expect_that(g[[, 1:3, edges=TRUE]], globalVar
200 expect_that(g[['a', , edges=TRUE]], globalVar
202 expect_that(g[[, 'b', edges=TRUE]], globalVar
209 expect_that(g[[letters[1:3],, edges=TRUE]], globalVar
211 expect_that(g[[, letters[1:3], edges=TRUE]], globalVar
215 expect_that(g[[1:10, 1:10, edges=TRUE]], globalVar
[all …]
|
| /dports/cad/csxcad/CSXCAD-0.6.2-103-g3c4fb66/matlab/ |
| H A D | DetectEdges.m | 105 edges = {}; variable
158 edges = AddEdge (edges, box, x1, y1, z1, CoordSystem, debug); variable
159 edges = AddEdge (edges, box, x2, y2, z2, CoordSystem, debug); variable
178 … edges = AddEdge (edges, poly, edge(1), edge(2), edge(3), CoordSystem, debug); variable
181 … edges = AddEdge (edges, poly, edge(1), edge(2), edge(3), CoordSystem, debug); variable
198 edges = AddEdge (edges, cylinder, x1 - r, y1 - r, z1, CoordSystem, debug); variable
199 edges = AddEdge (edges, cylinder, x2 + r, y2 + r, z2, CoordSystem, debug); variable
202 edges = AddEdge (edges, cylinder, x1 - r, y1, z1 - r, CoordSystem, debug); variable
203 edges = AddEdge (edges, cylinder, x2 + r, y2, z2 + r, CoordSystem, debug); variable
206 edges = AddEdge (edges, cylinder, x1, y1 - r, z1 - r, CoordSystem, debug); variable
[all …]
|
| /dports/misc/py-orange3-network/orange3-network-ec534c9/orangecontrib/network/network/ |
| H A D | twomode.py | 41 def norm_dot(edges): argument
54 def _weight_no_weights(edges): argument
61 def _weight_connections(edges, **_): argument
68 def _weight_weighted_connections(edges, **_): argument
73 def _weight_geo(edges, wuu, wvv): argument
78 def _weight_geodeg(edges, **_): argument
86 def _weight_input(edges, wvv, **_): argument
91 def _weight_output(edges, wuu, **_): argument
95 def _norm_min_max(edges, wuu, wvv, f): argument
105 def _weight_min(edges, wuu, wvv): argument
[all …]
|
| /dports/databases/puppetdb6/puppetdb-6.19.1/ext/docs/puppetdb/api/query/v4/ |
| H A D | edges.markdown | 26 ### URL parameters
33 ### Query operators
37 ### Query fields
46 ### Response format
59 ### Example
|
| /dports/databases/puppetdb7/puppetdb-7.8.0/ext/docs/puppetdb/api/query/v4/ |
| H A D | edges.markdown | 26 ### URL parameters
33 ### Query operators
37 ### Query fields
46 ### Response format
59 ### Example
|
| /dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/geom3d/ |
| H A D | drawEdge3d.m | 73 edges = varargin{1}; variable
78 edges = [varargin{1}(1,:) varargin{1}(2,:)]; variable
81 edges = [varargin{1}(1,:) varargin{1}(2,:)]; variable
85 edges = [varargin{1} varargin{2}]; variable
90 edges = [varargin{1} varargin{2} varargin{3} varargin{4} varargin{5} varargin{6}]; variable
|
| /dports/net/samba412/samba-4.12.15/python/samba/kcc/ |
| H A D | graph_utils.py | 47 def verify_graph_complete(edges, vertices, edge_vertices): argument
61 def verify_graph_connected(edges, vertices, edge_vertices): argument
94 def verify_graph_connected_under_edge_failures(edges, vertices, edge_vertices): argument
109 def verify_graph_connected_under_vertex_failures(edges, vertices, argument
118 def verify_graph_forest(edges, vertices, edge_vertices): argument
144 def verify_graph_multi_edge_forest(edges, vertices, edge_vertices): argument
170 def verify_graph_no_lonely_vertices(edges, vertices, edge_vertices): argument
178 def verify_graph_no_unknown_vertices(edges, vertices, edge_vertices): argument
186 def verify_graph_directed_double_ring(edges, vertices, edge_vertices): argument
283 def verify_graph(edges, vertices=None, directed=False, properties=()): argument
[all …]
|
| /dports/graphics/py-toyplot/toyplot-0.19.0/toyplot/ |
| H A D | layout.py | 252 def edges(self): member in Graph
358 def _adjacency_list(vcount, edges): argument
401 def edges(self, vcoordinates, edges): argument
433 def edges(self, vcoordinates, edges): member in StraightEdges
458 def edges(self, vcoordinates, edges): argument
480 def graph(self, vcoordinates, edges): argument
522 def __init__(self, edges=None): argument
528 def graph(self, vcoordinates, edges): argument
550 def graph(self, vcoordinates, edges): argument
584 def graph(self, vcoordinates, edges): argument
[all …]
|
| /dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/graphs/ |
| H A D | boundaryGraph.m | 66 edges = zeros([0 2]); % first node and second nodes variable
100 edges = repmat(1:2, [ne 1]) + repmat((0:2:2*ne-1)', [1 2]); variable
105 edges = unique(sort(edges, 2), 'rows'); variable
145 edges = [edges ; [faces(:,1) faces(:,2)]]; variable
146 edges = [edges ; [faces(:,2) faces(:,3)]]; variable
147 edges = [edges ; [faces(:,3) faces(:,4)]]; variable
148 edges = [edges ; [faces(:,4) faces(:,1)]]; variable
149 edges = unique(sort(edges, 2), 'rows'); variable
|
| H A D | adjacencyListToEdges.m | 60 edges = zeros([0 2]); variable
65 edges = [edges ; edge]; %#ok<AGROW> variable
68 edges = unique(edges, 'rows'); variable
|
| /dports/devel/spark/spark-2.1.1/graphx/src/test/scala/org/apache/spark/graphx/ |
| H A D | GraphOpsSuite.scala | 29 val edges = sc.parallelize((Seq(Edge(1, 2, "onetwo")))) constant
75 val edges = sc.parallelize((1 to n).map(x => Edge(0, x, x))) constant
98 val edges = constant
112 val edges = graph.collectEdges(EdgeDirection.Out).cache() constant
127 val edges = graph.collectEdges(EdgeDirection.In).cache() constant
142 val edges = graph.collectEdges(EdgeDirection.Either).cache() constant
158 val edges = graph.collectEdges(EdgeDirection.Out).cache() constant
173 val edges = graph.collectEdges(EdgeDirection.In).cache() constant
190 val edges = graph.collectEdges(EdgeDirection.Either).cache() constant
|
| /dports/math/igraph/igraph-0.9.5/src/games/ |
| H A D | growing_random.c | 62 igraph_vector_t edges = IGRAPH_VECTOR_NULL; in igraph_growing_random_game() local
85 VECTOR(edges)[resp++] = i; in igraph_growing_random_game() local
86 VECTOR(edges)[resp++] = to; in igraph_growing_random_game() local
90 VECTOR(edges)[resp++] = from; in igraph_growing_random_game() local
91 VECTOR(edges)[resp++] = to; in igraph_growing_random_game() local
|
| /dports/science/py-pymatgen/pymatgen-2022.0.15/pymatgen/analysis/chemenv/utils/ |
| H A D | math_utils.py | 168 def smoothstep(xx, edges=None, inverse=False): argument
184 def smootherstep(xx, edges=None, inverse=False): argument
200 def cosinus_step(xx, edges=None, inverse=False): argument
216 def power3_step(xx, edges=None, inverse=False): argument
226 def powern_parts_step(xx, edges=None, inverse=False, nn=2): argument
269 def powern_decreasing(xx, edges=None, nn=2): argument
283 def power2_decreasing_exp(xx, edges=None, alpha=1.0): argument
302 def power2_tangent_decreasing(xx, edges=None, prefactor=None): argument
320 def power2_inverse_decreasing(xx, edges=None, prefactor=None): argument
338 def power2_inverse_power2_decreasing(xx, edges=None, prefactor=None): argument
[all …]
|
| /dports/science/rdkit/rdkit-Release_2021_03_5/External/RingFamilies/RingDecomposerLib/src/python/bin/ |
| H A D | simple_demo.py | 36 def calculate_and_print_urfs(edges): argument
68 def minimal_example(edges): argument
77 edges = [ variable
|
| /dports/graphics/colmap/colmap-3.6/src/base/ |
| H A D | graph_cut_test.cc | 40 const std::vector<std::pair<int, int>> edges = { in BOOST_AUTO_TEST_CASE() local
57 const std::vector<std::pair<int, int>> edges = { in BOOST_AUTO_TEST_CASE() local
74 const std::vector<std::pair<int, int>> edges = { in BOOST_AUTO_TEST_CASE() local
90 const std::vector<std::pair<int, int>> edges = {{0, 1}, {1, 2}, {3, 4}}; in BOOST_AUTO_TEST_CASE() local
104 const std::vector<std::pair<int, int>> edges = { in BOOST_AUTO_TEST_CASE() local
118 const std::vector<std::pair<int, int>> edges = { in BOOST_AUTO_TEST_CASE() local
132 const std::vector<std::pair<int, int>> edges = { in BOOST_AUTO_TEST_CASE() local
145 const std::vector<std::pair<int, int>> edges = {{0, 1}, {1, 2}, {3, 4}}; in BOOST_AUTO_TEST_CASE() local
|
| /dports/graphics/R-cran-visNetwork/visNetwork/inst/shiny/src/server/ |
| H A D | proxy_get_server.R | 4 edges <- data.frame(from = c(1,2), to = c(1,3)) dataframe
6 list(nodes = nodes, edges = edges) nameattr
40 edges <- edges <- data.frame(id = "newedges", from = c(4), to = c(1)) dataframe
|