Home
last modified time | relevance | path

Searched refs:outdeg (Results 1 – 25 of 81) sorted by relevance

1234

/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Digraph_degree_sequence_game.c25 igraph_vector_t outdeg, indeg, degrees, empty; in main() local
35 igraph_vector_view(&outdeg, outarr, n); in main()
46 igraph_degree_sequence_game(&g, &outdeg, NULL, IGRAPH_DEGSEQ_SIMPLE); in main()
52 IGRAPH_ASSERT(igraph_vector_all_e(&outdeg, &degrees)); in main()
69 IGRAPH_ASSERT(igraph_vector_all_e(&outdeg, &degrees)); in main()
92 IGRAPH_ASSERT(igraph_vector_all_e(&outdeg, &degrees)); in main()
112 IGRAPH_ASSERT(igraph_vector_all_e(&outdeg, &degrees)); in main()
135 IGRAPH_ASSERT(igraph_vector_all_e(&outdeg, &degrees)); in main()
155 IGRAPH_ASSERT(igraph_vector_all_e(&outdeg, &degrees)); in main()
169 igraph_degree_sequence_game(&g, &outdeg, NULL, IGRAPH_DEGSEQ_VL); in main()
[all …]
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Digraph_degree_sequence_game.c6 igraph_vector_t outdeg, indeg, vec; in main() local
12 igraph_vector_init_real(&outdeg, 10, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0); in main()
17 igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_SIMPLE); in main()
28 igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_VL); in main()
42 igraph_degree_sequence_game(&g, &outdeg, &indeg, IGRAPH_DEGSEQ_SIMPLE); in main()
57 igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE); in main()
71 igraph_degree_sequence_game(&g, &outdeg, &indeg, IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE); in main()
89 igraph_vector_destroy(&outdeg); in main()
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/coll/libnbc/
H A Dnbc_neighbor_helpers.c43 int res, indeg, outdeg; in NBC_Comm_neighbors() local
47 res = NBC_Comm_neighbors_count(comm, &indeg, &outdeg); in NBC_Comm_neighbors()
53 *dest_count = outdeg; in NBC_Comm_neighbors()
64 if (outdeg) { in NBC_Comm_neighbors()
65 *destinations = malloc (sizeof (int) * outdeg); in NBC_Comm_neighbors()
76 if (0 == indeg && 0 == outdeg) { in NBC_Comm_neighbors()
85 assert (indeg == outdeg); in NBC_Comm_neighbors()
98 …mca_topo_base_dist_graph_neighbors (comm, indeg, sources[0], MPI_UNWEIGHTED, outdeg, destinations[… in NBC_Comm_neighbors()
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/coll/libnbc/
H A Dnbc_neighbor_helpers.c43 int res, indeg, outdeg; in NBC_Comm_neighbors() local
47 res = NBC_Comm_neighbors_count(comm, &indeg, &outdeg); in NBC_Comm_neighbors()
53 *dest_count = outdeg; in NBC_Comm_neighbors()
64 if (outdeg) { in NBC_Comm_neighbors()
65 *destinations = malloc (sizeof (int) * outdeg); in NBC_Comm_neighbors()
76 if (0 == indeg && 0 == outdeg) { in NBC_Comm_neighbors()
85 assert (indeg == outdeg); in NBC_Comm_neighbors()
98 …mca_topo_base_dist_graph_neighbors (comm, indeg, sources[0], MPI_UNWEIGHTED, outdeg, destinations[… in NBC_Comm_neighbors()
/dports/math/R-cran-igraph/igraph/src/
H A Ddegree_sequence.cpp195 vertices.push_back(vbd_pair(i, bidegree(VECTOR(*indeg)[i], VECTOR(*outdeg)[i]))); in igraph_i_kleitman_wang()
362 const igraph_vector_t *outdeg, in igraph_i_realize_directed_degree_sequence() argument
365 long node_count = igraph_vector_size(outdeg); in igraph_i_realize_directed_degree_sequence()
366 long edge_count = long(igraph_vector_sum(outdeg)); in igraph_i_realize_directed_degree_sequence()
375 if (igraph_vector_min(outdeg) < 0 || igraph_vector_min(indeg) < 0) { in igraph_i_realize_directed_degree_sequence()
385 IGRAPH_CHECK(igraph_i_kleitman_wang(outdeg, indeg, &edges, true)); in igraph_i_realize_directed_degree_sequence()
388 IGRAPH_CHECK(igraph_i_kleitman_wang(outdeg, indeg, &edges, false)); in igraph_i_realize_directed_degree_sequence()
391 IGRAPH_CHECK(igraph_i_kleitman_wang_index(outdeg, indeg, &edges)); in igraph_i_realize_directed_degree_sequence()
490 const igraph_vector_t *outdeg, const igraph_vector_t *indeg, in igraph_realize_degree_sequence() argument
492 long n = igraph_vector_size(outdeg); in igraph_realize_degree_sequence()
[all …]
/dports/math/nauty/nauty27r3/
H A Ddirectg.c105 static int lastlev[MAXNV],indeg[MAXNV],outdeg[MAXNV]; variable
328 ++outdeg[w0]; ++indeg[w1]; in scan()
329 if (lastlev[w0] == level && DEGPRUNE(indeg,outdeg,w0,n) in scan()
337 --outdeg[w0]; --indeg[w1]; in scan()
344 ++outdeg[w1]; ++indeg[w0]; in scan()
353 --outdeg[w1]; --indeg[w0]; in scan()
367 ++outdeg[w0]; ++outdeg[w1]; in scan()
378 --outdeg[w0]; --outdeg[w1]; in scan()
437 for (i = 0; i < n; ++i) indeg[i] = outdeg[i] = 0; in direct()
444 if (DEGPRUNE(indeg,outdeg,i,n)) break; in direct()
[all …]
H A Dwatercluster2.c1050 (outdeg[center]<maxoutdeg) && (outdeg[end]<maxoutdeg)) in construct_operations_one()
1211 if (outdeg[list[i]]<maxoutdeg) in construct_operations_in()
1307 if ((bufferg) && (outdeg[top]<minout)) { minout=outdeg[top]; do_double=double_allowed; } in construct_extensions()
1329 if (outdeg[top]<minout) in construct_extensions()
1330 { if ((bufferg== (graph)0) || (outdeg[j]>outdeg[top])) // otherwise the end would be better in construct_extensions()
1336 if ((outdeg[j]==outdeg[top]) && double_allowed) in construct_extensions()
1362 { lowerlimit_outdeg=outdeg[top2]; mindouble=indeg[top2]+outdeg[top2]-deg[top2]; } in construct_extensions()
1583 testoutdeg=outdeg[center]; in canonical()
1671 if (outdeg[k]==testoutdeg) in canonical()
1694 if (outdeg[k]==testoutdeg) in canonical()
[all …]
H A Dgutil1.c151 int outdeg[MAXN]; in degstats2() local
154 DYNALLSTAT(int,outdeg,outdeg_sz); in degstats2()
170 DYNALLOC1(int,outdeg,outdeg_sz,n,"degstats2"); in degstats2()
226 for (i = 0; i < n; ++i) indeg[i] = outdeg[i] = 0; in degstats2()
235 ++outdeg[i]; in degstats2()
238 ned += outdeg[i]; in degstats2()
271 mind = maxd = outdeg[0]; in degstats2()
276 d = outdeg[i]; in degstats2()
300 if (indeg[i] != outdeg[i]) break; in degstats2()
/dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/
H A Ddirectg.c105 static int lastlev[MAXNV],indeg[MAXNV],outdeg[MAXNV]; variable
328 ++outdeg[w0]; ++indeg[w1]; in scan()
329 if (lastlev[w0] == level && DEGPRUNE(indeg,outdeg,w0,n) in scan()
337 --outdeg[w0]; --indeg[w1]; in scan()
344 ++outdeg[w1]; ++indeg[w0]; in scan()
353 --outdeg[w1]; --indeg[w0]; in scan()
367 ++outdeg[w0]; ++outdeg[w1]; in scan()
378 --outdeg[w0]; --outdeg[w1]; in scan()
437 for (i = 0; i < n; ++i) indeg[i] = outdeg[i] = 0; in direct()
444 if (DEGPRUNE(indeg,outdeg,i,n)) break; in direct()
[all …]
H A Dwatercluster2.c1050 (outdeg[center]<maxoutdeg) && (outdeg[end]<maxoutdeg)) in construct_operations_one()
1211 if (outdeg[list[i]]<maxoutdeg) in construct_operations_in()
1307 if ((bufferg) && (outdeg[top]<minout)) { minout=outdeg[top]; do_double=double_allowed; } in construct_extensions()
1329 if (outdeg[top]<minout) in construct_extensions()
1330 { if ((bufferg== (graph)0) || (outdeg[j]>outdeg[top])) // otherwise the end would be better in construct_extensions()
1336 if ((outdeg[j]==outdeg[top]) && double_allowed) in construct_extensions()
1362 { lowerlimit_outdeg=outdeg[top2]; mindouble=indeg[top2]+outdeg[top2]-deg[top2]; } in construct_extensions()
1583 testoutdeg=outdeg[center]; in canonical()
1671 if (outdeg[k]==testoutdeg) in canonical()
1694 if (outdeg[k]==testoutdeg) in canonical()
[all …]
H A Dgutil1.c151 int outdeg[MAXN]; in degstats2() local
154 DYNALLSTAT(int,outdeg,outdeg_sz); in degstats2()
170 DYNALLOC1(int,outdeg,outdeg_sz,n,"degstats2"); in degstats2()
226 for (i = 0; i < n; ++i) indeg[i] = outdeg[i] = 0; in degstats2()
235 ++outdeg[i]; in degstats2()
238 ned += outdeg[i]; in degstats2()
271 mind = maxd = outdeg[0]; in degstats2()
276 d = outdeg[i]; in degstats2()
300 if (indeg[i] != outdeg[i]) break; in degstats2()
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Ddegree_sequence.cpp380 vertices.push_back(vbd_pair(i, bidegree(VECTOR(*indeg)[i], VECTOR(*outdeg)[i]))); in igraph_i_kleitman_wang()
451 vertices.push_back(vbd_pair(i, bidegree(VECTOR(*indeg)[i], VECTOR(*outdeg)[i]))); in igraph_i_kleitman_wang_index()
603 const igraph_vector_t *outdeg, in igraph_i_realize_directed_degree_sequence() argument
608 long node_count = igraph_vector_size(outdeg); in igraph_i_realize_directed_degree_sequence()
609 long edge_count = long(igraph_vector_sum(outdeg)); in igraph_i_realize_directed_degree_sequence()
618 if (node_count > 0 && (igraph_vector_min(outdeg) < 0 || igraph_vector_min(indeg) < 0)) { in igraph_i_realize_directed_degree_sequence()
633 IGRAPH_CHECK(igraph_i_kleitman_wang(outdeg, indeg, &edges, true)); in igraph_i_realize_directed_degree_sequence()
636 IGRAPH_CHECK(igraph_i_kleitman_wang(outdeg, indeg, &edges, false)); in igraph_i_realize_directed_degree_sequence()
639 IGRAPH_CHECK(igraph_i_kleitman_wang_index(outdeg, indeg, &edges)); in igraph_i_realize_directed_degree_sequence()
765 const igraph_vector_t *outdeg, const igraph_vector_t *indeg, in igraph_realize_degree_sequence() argument
[all …]
/dports/math/ogdf/OGDF/src/ogdf/layered/
H A DGreedyCycleRemoval.cpp42 if (v->outdeg() == 0) i = m_min; in dfs()
44 else i = v->outdeg() - v->indeg(); in dfs()
48 m_out[v] = v->outdeg(); in dfs()
66 if ( v->outdeg() > m_max) m_max = v->outdeg(); in call()
H A DDfsAcyclicSubgraph.cpp76 NodeArray<int> outdeg(G,0); in callUML() local
84 outdeg[src]++; in callUML()
97 if(outdeg[v] == 0) in callUML()
108 if (w != v && --outdeg[w] == 0) { in callUML()
H A DLongestPathRanking.cpp175 NodeArray<int> outdeg(GC,0); in callUML() local
181 ++outdeg[v]; in callUML()
196 --outdeg[u]; in callUML()
197 if(outdeg[u] == 0) { in callUML()
204 outdeg.init(); in callUML()
/dports/biology/abyss/abyss-2.3.1/Graph/
H A DPopBubbles.h94 unsigned outdeg = out_degree(*it, g); in discoverBubbles() local
99 << '\t' << indeg << '\t' << outdeg in discoverBubbles()
101 << '\t' << sum + (int)outdeg << '\n'; in discoverBubbles()
116 if (outdeg == 0) in discoverBubbles()
118 sum += outdeg; in discoverBubbles()
H A DDotIO.h58 unsigned outdeg = out_degree(u, g); in write_edges() local
59 if (outdeg == 0) in write_edges()
62 if (outdeg > 1) in write_edges()
68 if (outdeg > 1) in write_edges()
/dports/graphics/R-cran-DiagrammeR/DiagrammeR/tests/testthat/
H A Dtest-node_edge_info.R68 info_nodes$outdeg, "numeric")
108 info_nodes_no_edges$outdeg %>%
/dports/math/ogdf/OGDF/src/ogdf/upward/
H A DFaceSinkGraph.cpp215 if(vOrig && vOrig->indeg() >= 1 && vOrig->outdeg() >= 1) in dfsCheckForest()
289 if (vOrig != nullptr && vOrig->indeg() > 0 && vOrig->outdeg() > 0) in stAugmentation()
353 if (vOrig != nullptr && vOrig->indeg() > 0 && vOrig->outdeg() > 0) in stAugmentation()
420 if (u->outdeg() == 0 && !visited[u]) in sinkSwitches()
462 if (u->outdeg() == 0) in sinkSwitches()
H A DExpansionGraph.cpp106 if (original(v) && v->indeg() >= 1 && v->outdeg() >= 1) { in init()
149 if (original(v) && v->indeg() >= 1 && v->outdeg() >= 1) { in init()
/dports/math/R-cran-igraph/igraph/tests/testthat/
H A Dtest_assortativity.R11 outdeg <- degree(graph, mode="out") functionVar
13 J <- outdeg[el[,1]]-1
/dports/net/py-mpi4py/mpi4py-3.1.3/test/
H A Dtest_cco_ngh_obj.py57 indeg, outdeg, w = comm.Get_dist_neighbors_count()
58 return indeg, outdeg
/dports/math/ogdf/OGDF/src/ogdf/upward/internal/
H A DUpwardPlanaritySingleSource.cpp506 if (v->outdeg() > 0) continue; in testBiconnectedComponent()
594 if(x->outdeg() != degInfo.m_outdegSrc) in checkDegrees()
598 if(y->outdeg() != degInfo.m_outdegTgt) in checkDegrees()
707 degInfo[eRef].m_outdegSrc = srcOrig->outdeg() - outdegSrc; in computeDegreesInPertinent()
711 degInfo[eRef].m_outdegTgt = tgtOrig->outdeg() - outdegTgt; in computeDegreesInPertinent()
1125 OGDF_ASSERT(v->outdeg() == 0); in embedSkeleton()
1164 if (vOrig != nullptr && vOrig->indeg() > 0 && vOrig->outdeg() > 0) in assignSinks()
/dports/math/ogdf/OGDF/include/ogdf/layered/
H A DHierarchy.h77 return m_GC.isDummy(v) && v->outdeg() == 1; in isLongEdgeDummy()
/dports/math/ogdf/OGDF/include/ogdf/planarity/embedder/
H A DEmbedderBCTreeBase.h79 if (v->outdeg() == 0) { in initBCTree()

1234