Home
last modified time | relevance | path

Searched refs:adjlist (Results 1 – 25 of 149) sorted by relevance

123456

/dports/security/steghide/steghide-0.5.1/tests/
H A DDFSAPHeuristicTest.cc51 adjlist[0].push_back(1) ; in setup()
79 adjlist[2].push_back(3) ; adjlist[2].push_back(6) ; in setup()
82 adjlist[5].push_back(6) ; adjlist[5].push_back(7) ; in setup()
97 adjlist[0].push_back(1) ; adjlist[0].push_back(6) ; in setup()
98 adjlist[1].push_back(2) ; adjlist[1].push_back(7) ; in setup()
99 adjlist[2].push_back(3) ; adjlist[2].push_back(6) ; in setup()
117 adjlist[0].push_back(2) ; adjlist[0].push_back(4) ; in setup()
118 adjlist[1].push_back(3) ; adjlist[1].push_back(5) ; in setup()
119 adjlist[2].push_back(3) ; adjlist[2].push_back(12) ; in setup()
121 adjlist[4].push_back(6) ; adjlist[4].push_back(12) ; in setup()
[all …]
H A DBFSAPHeuristicTest.cc50 std::vector<std::list<UWORD16> > adjlist (2) ; in setup() local
51 adjlist[0].push_back(1) ; in setup()
61 std::vector<std::list<UWORD16> > adjlist (4) ; in setup() local
62 adjlist[0].push_back(1) ; in setup()
63 adjlist[1].push_back(2) ; in setup()
64 adjlist[2].push_back(3) ; in setup()
77 adjlist[0].push_back(1) ; adjlist[0].push_back(2) ; in setup()
78 adjlist[1].push_back(2) ; in setup()
79 adjlist[2].push_back(3) ; in setup()
92 adjlist[0].push_back(1) ; adjlist[0].push_back(2) ; in setup()
[all …]
H A DWKSConstructionHeuristicTest.cc46 std::vector<std::list<UWORD16> > adjlist (2) ; in setup() local
47 adjlist[0].push_back(1) ; in setup()
48 DummyFile::createGraph (adjlist, &bs1, &f1, &s1) ; in setup()
58 std::vector<std::list<UWORD16> > adjlist (4) ; in setup() local
59 adjlist[0].push_back(1) ; adjlist[0].push_back(2) ; adjlist[0].push_back(3) ; in setup()
60 adjlist[1].push_back(2) ; adjlist[1].push_back(3) ; in setup()
61 DummyFile::createGraph (adjlist, &bs2, &f2, &s2) ; in setup()
71 std::vector<std::list<UWORD16> > adjlist (4) ; in setup() local
72 adjlist[0].push_back(1) ; adjlist[0].push_back(2) ; in setup()
73 adjlist[1].push_back(3) ; in setup()
[all …]
H A DDummyFile.cc63 void DummyFile::createGraph (std::vector<std::list<UWORD16> >& adjlist, BitString** bs, CvrStgFile*… in createGraph() argument
65 unsigned int numvertices = adjlist.size() ; in createGraph()
69 …for (std::list<UWORD16>::iterator destv = adjlist[srcv].begin() ; destv != adjlist[srcv].end() ; d… in createGraph()
71 adjlist[srcv].erase (destv) ; in createGraph()
86 …for (std::list<UWORD16>::const_iterator destv = adjlist[srcv].begin() ; destv != adjlist[srcv].end… in createGraph()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Common/
H A Dnetwork.c41 elist *adjlist; in createnet() local
60 adjlist = n->adjlist; in createnet()
98 verts[nv0].last = adjlist; in createnet()
104 adjlist++; in createnet()
111 verts[nv1].last = adjlist; in createnet()
117 adjlist++; in createnet()
150 elist *adjlist; in createnet2() local
172 adjlist = n->adjlist; in createnet2()
229 adjlist++; in createnet2()
242 adjlist++; in createnet2()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Common/
H A Dnetwork.c41 elist *adjlist; in create_net() local
62 adjlist = n->adjlist; in create_net()
111 verts[nv0].last = adjlist; in create_net()
117 adjlist++; in create_net()
124 verts[nv1].last = adjlist; in create_net()
130 adjlist++; in create_net()
162 elist *adjlist; in create_flow_net() local
188 adjlist = n->adjlist; in create_flow_net()
308 adjlist++; in create_flow_net()
321 adjlist++; in create_flow_net()
[all …]
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Dadjlist.c25 igraph_adjlist_t adjlist; in test_simple_trees() local
34 igraph_adjlist_destroy(&adjlist); in test_simple_trees()
41 igraph_adjlist(&g2, &adjlist, IGRAPH_IN, /*duplicate=*/ 0); in test_simple_trees()
44 igraph_adjlist_destroy(&adjlist); in test_simple_trees()
54 igraph_adjlist_destroy(&adjlist); in test_simple_trees()
64 print_adjlist(&adjlist); \
66 igraph_adjlist_destroy(&adjlist); \
79 igraph_adjlist_t adjlist; in test_loop_elimination_for_undirected_graph() local
119 igraph_adjlist_t adjlist; in test_loop_elimination_for_directed_graph() local
175 igraph_adjlist_t adjlist; in test_multiedge_elimination_for_undirected_graph() local
[all …]
/dports/math/concorde/concorde/HELDKARP/
H A Dheldkarp.c162 int **adjlist = (int **) NULL; in CCheldkarp_small_elist() local
193 adjlist = CC_SAFE_MALLOC (ncount-1, int *); in CCheldkarp_small_elist()
203 adjlist[i] = p; in CCheldkarp_small_elist()
218 adjlist[n1-1][n2-1] = adjlist[n2-1][n1-1] = i+1; in CCheldkarp_small_elist()
262 CC_IFFREE (adjlist, int *); in CCheldkarp_small_elist()
311 set_adjlist (n0, n1, adjlist, zadjlist, 0); in hk_work()
326 set_adjlist (n0, n1, adjlist, zadjlist, -(ebranch+1)); in hk_work()
338 set_adjlist (n0, n1, adjlist, zadjlist, ebranch+1); in hk_work()
417 span_tree (ncount-1, adjlist, len, y+1, tree, notree); in one_tree()
480 tptr = adjlist[cur]; in span_tree()
[all …]
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Ddistances.c40 const igraph_adjlist_t *adjlist) { in igraph_i_eccentricity() argument
59 if (!adjlist) { in igraph_i_eccentricity()
87 if (adjlist) { in igraph_i_eccentricity()
88 neis = igraph_adjlist_get(adjlist, act); in igraph_i_eccentricity()
115 if (!adjlist) { in igraph_i_eccentricity()
200 igraph_adjlist_t adjlist; in igraph_radius() local
202 IGRAPH_CHECK(igraph_adjlist_init(graph, &adjlist, mode, IGRAPH_LOOPS, IGRAPH_MULTIPLE)); in igraph_radius()
203 IGRAPH_FINALLY(igraph_adjlist_destroy, &adjlist); in igraph_radius()
206 mode, &adjlist)); in igraph_radius()
209 igraph_adjlist_destroy(&adjlist); in igraph_radius()
/dports/math/R-cran-igraph/igraph/src/
H A Ddistances.c38 const igraph_adjlist_t *adjlist) { in igraph_i_eccentricity() argument
57 if (!adjlist) { in igraph_i_eccentricity()
85 if (adjlist) { in igraph_i_eccentricity()
86 neis = igraph_adjlist_get(adjlist, act); in igraph_i_eccentricity()
113 if (!adjlist) { in igraph_i_eccentricity()
198 igraph_adjlist_t adjlist; in igraph_radius() local
200 IGRAPH_CHECK(igraph_adjlist_init(graph, &adjlist, mode)); in igraph_radius()
201 IGRAPH_FINALLY(igraph_adjlist_destroy, &adjlist); in igraph_radius()
204 mode, &adjlist)); in igraph_radius()
207 igraph_adjlist_destroy(&adjlist); in igraph_radius()
H A Dmaximal_cliques.c42 igraph_adjlist_t *adjlist);
48 const igraph_adjlist_t *adjlist,
57 igraph_adjlist_t *adjlist, int mynextv,
64 igraph_adjlist_t *adjlist, int v,
70 igraph_adjlist_t *adjlist,
120 igraph_adjlist_t *adjlist) { in igraph_i_maximal_cliques_reorder_adjlists() argument
126 igraph_vector_int_t *avneis = igraph_adjlist_get(adjlist, av); in igraph_i_maximal_cliques_reorder_adjlists()
151 const igraph_adjlist_t *adjlist, in igraph_i_maximal_cliques_select_pivot() argument
162 igraph_vector_int_t *avneis = igraph_adjlist_get(adjlist, av); in igraph_i_maximal_cliques_select_pivot()
189 pivotvectneis = igraph_adjlist_get(adjlist, *pivot); in igraph_i_maximal_cliques_select_pivot()
[all …]
H A Dtriangles_template1.h33 igraph_lazy_adjlist_t adjlist; variable
47 igraph_lazy_adjlist_init(graph, &adjlist, IGRAPH_ALL, IGRAPH_SIMPLIFY);
48 IGRAPH_FINALLY(igraph_lazy_adjlist_destroy, &adjlist);
55 neis1 = igraph_lazy_adjlist_get(&adjlist, (igraph_integer_t) node);
64 neis2 = igraph_lazy_adjlist_get(&adjlist, (igraph_integer_t) v);
85 igraph_lazy_adjlist_destroy(&adjlist);
H A Dmaximal_cliques_template.h189 igraph_adjlist_t *adjlist, in FUNCTION()
209 adjlist, &pivot, nextv, in FUNCTION()
220 pos, adjlist, RESNAME, nextv, H, in FUNCTION()
254 igraph_adjlist_t adjlist, fulladjlist; in FUNCTION() local
280 igraph_adjlist_init(graph, &adjlist, IGRAPH_ALL); in FUNCTION()
282 igraph_adjlist_simplify(&adjlist); in FUNCTION()
355 igraph_vector_int_update(igraph_adjlist_get(&adjlist, v), in FUNCTION()
360 igraph_vector_int_t *radj = igraph_adjlist_get(&adjlist, vv); in FUNCTION()
374 &adjlist); in FUNCTION()
378 &adjlist, RESNAME, &nextv, &H, min_size, in FUNCTION()
[all …]
H A Ddecomposition.c64 igraph_adjlist_t adjlist; in igraph_maximum_cardinality_search() local
99 IGRAPH_CHECK(igraph_adjlist_init(graph, &adjlist, IGRAPH_ALL)); in igraph_maximum_cardinality_search()
100 IGRAPH_FINALLY(igraph_adjlist_destroy, &adjlist); in igraph_maximum_cardinality_search()
164 neis = igraph_adjlist_get(&adjlist, v); in igraph_maximum_cardinality_search()
226 igraph_adjlist_destroy(&adjlist); in igraph_maximum_cardinality_search()
285 igraph_adjlist_t adjlist; in igraph_is_chordal() local
336 IGRAPH_CHECK(igraph_adjlist_init(graph, &adjlist, IGRAPH_ALL)); in igraph_is_chordal()
337 IGRAPH_FINALLY(igraph_adjlist_destroy, &adjlist); in igraph_is_chordal()
368 neis = igraph_adjlist_get(&adjlist, w); in igraph_is_chordal()
441 igraph_adjlist_destroy(&adjlist); in igraph_is_chordal()
/dports/math/igraph/igraph-0.9.5/src/cliques/
H A Dmaximal_cliques.c43 igraph_adjlist_t *adjlist);
49 const igraph_adjlist_t *adjlist,
58 igraph_adjlist_t *adjlist, int mynextv,
65 igraph_adjlist_t *adjlist, int v,
71 igraph_adjlist_t *adjlist,
121 igraph_adjlist_t *adjlist) { in igraph_i_maximal_cliques_reorder_adjlists() argument
154 const igraph_adjlist_t *adjlist, in igraph_i_maximal_cliques_select_pivot() argument
194 pivotvectneis = igraph_adjlist_get(adjlist, *pivot); in igraph_i_maximal_cliques_select_pivot()
270 IGRAPH_UNUSED(adjlist); in igraph_i_maximal_cliques_PX()
284 igraph_adjlist_t *adjlist, in igraph_i_maximal_cliques_up() argument
[all …]
H A Dmaximal_cliques_template.h195 igraph_adjlist_t *adjlist, in FUNCTION()
215 adjlist, &pivot, nextv, in FUNCTION()
226 pos, adjlist, RESNAME, nextv, H, in FUNCTION()
243 igraph_i_maximal_cliques_up(PX, PS, PE, XS, XE, pos, adjlist, R, H); in FUNCTION()
260 igraph_adjlist_t adjlist, fulladjlist; in FUNCTION() local
287 IGRAPH_FINALLY(igraph_adjlist_destroy, &adjlist); in FUNCTION()
361 igraph_vector_int_update(igraph_adjlist_get(&adjlist, v), in FUNCTION()
366 igraph_vector_int_t *radj = igraph_adjlist_get(&adjlist, vv); in FUNCTION()
380 &adjlist); in FUNCTION()
384 &adjlist, RESNAME, &nextv, &H, min_size, in FUNCTION()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutPool/
H A Dvrp_cp.c365 pool_edge *adjlist; in create_pool_net() local
376 adjlist = n->adjlist; in create_pool_net()
382 verts[nv0].first = adjlist; in create_pool_net()
385 verts[nv0].first = adjlist; in create_pool_net()
387 adjlist->other_end = nv1; in create_pool_net()
389 adjlist++; in create_pool_net()
391 verts[nv1].first = adjlist; in create_pool_net()
394 verts[nv1].first = adjlist; in create_pool_net()
396 adjlist->other_end = nv0; in create_pool_net()
398 adjlist++; in create_pool_net()
[all …]
/dports/math/igraph/igraph-0.9.5/src/properties/
H A Dtriangles_template1.h33 igraph_lazy_adjlist_t adjlist; variable
54 IGRAPH_CHECK(igraph_lazy_adjlist_init(graph, &adjlist, IGRAPH_ALL, IGRAPH_NO_LOOPS, IGRAPH_NO_MULTI…
55 IGRAPH_FINALLY(igraph_lazy_adjlist_destroy, &adjlist);
62 neis1 = igraph_lazy_adjlist_get(&adjlist, (igraph_integer_t) node);
71 neis2 = igraph_lazy_adjlist_get(&adjlist, (igraph_integer_t) v);
92 igraph_lazy_adjlist_destroy(&adjlist);
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/DrawGraph/
H A Dvrp_dg_network.c45 dg_net_elist *adjlist; in dg_createnet() local
52 n->adjlist = adjlist = in dg_createnet()
70 nv->first = nv->last = adjlist; in dg_createnet()
72 nv->last->next_edge = adjlist; in dg_createnet()
73 nv->last = adjlist; in dg_createnet()
75 adjlist->next_edge = NULL; in dg_createnet()
77 adjlist->data = nedge; in dg_createnet()
78 adjlist->other = verts + v[1-j]; in dg_createnet()
79 adjlist++; in dg_createnet()
95 FREE(n->adjlist); in dg_freenet()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/DrawGraph/
H A Dcnrp_dg_network.c44 dg_net_elist *adjlist; in dg_createnet() local
51 n->adjlist = adjlist = in dg_createnet()
69 nv->first = nv->last = adjlist; in dg_createnet()
71 nv->last->next_edge = adjlist; in dg_createnet()
72 nv->last = adjlist; in dg_createnet()
74 adjlist->next_edge = NULL; in dg_createnet()
76 adjlist->data = nedge; in dg_createnet()
77 adjlist->other = verts + v[1-j]; in dg_createnet()
78 adjlist++; in dg_createnet()
94 FREE(n->adjlist); in dg_freenet()
/dports/science/cdk/cdk-cdk-2.3/descriptor/qsarmolecular/src/main/java/org/openscience/cdk/qsar/descriptors/molecular/
H A DLongestAliphaticChainDescriptor.java154 private static int getMaxDepth(int[][] adjlist, int v, int prev) { in getMaxDepth() argument
156 for (int w : adjlist[v]) { in getMaxDepth()
159 int length = getMaxDepth(adjlist, w, v); in getMaxDepth()
194 final int[][] adjlist = GraphUtil.toAdjList(aliphaticParts); in calculate() local
195 for (int i = 0; i < adjlist.length; i++) { in calculate()
197 if (adjlist[i].length != 1) in calculate()
199 int length = getMaxDepth(adjlist, i, -1); in calculate()
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Dadjlist.c29 igraph_adjlist_t adjlist; in main() local
37 igraph_adjlist_init(&g, &adjlist, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTIPLE); in main()
38 igraph_adjlist(&g2, &adjlist, IGRAPH_OUT, /* duplicate = */ 0); in main()
43 igraph_adjlist_destroy(&adjlist); in main()
/dports/math/igraph/igraph-0.9.5/src/games/
H A Ddegree_sequence.c434 igraph_vector_ptr_t adjlist; in igraph_i_degree_sequence_game_no_multiple_undirected_uniform() local
462 IGRAPH_CHECK(igraph_vector_ptr_init(&adjlist, vcount)); in igraph_i_degree_sequence_game_no_multiple_undirected_uniform()
464 IGRAPH_FINALLY(igraph_vector_ptr_destroy_all, &adjlist); in igraph_i_degree_sequence_game_no_multiple_undirected_uniform()
471 VECTOR(adjlist)[i] = set; in igraph_i_degree_sequence_game_no_multiple_undirected_uniform() local
528 igraph_vector_ptr_destroy_all(&adjlist); in igraph_i_degree_sequence_game_no_multiple_undirected_uniform()
546 igraph_vector_ptr_t adjlist; in igraph_i_degree_sequence_game_no_multiple_directed_uniform() local
581 IGRAPH_CHECK(igraph_vector_ptr_init(&adjlist, vcount)); in igraph_i_degree_sequence_game_no_multiple_directed_uniform()
583 IGRAPH_FINALLY(igraph_vector_ptr_destroy_all, &adjlist); in igraph_i_degree_sequence_game_no_multiple_directed_uniform()
590 VECTOR(adjlist)[i] = set; in igraph_i_degree_sequence_game_no_multiple_directed_uniform() local
617 set = (igraph_set_t *) VECTOR(adjlist)[from]; in igraph_i_degree_sequence_game_no_multiple_directed_uniform()
[all …]
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dchordality.c76 igraph_adjlist_t adjlist; in igraph_maximum_cardinality_search() local
101 …IGRAPH_CHECK(igraph_adjlist_init(graph, &adjlist, IGRAPH_ALL, IGRAPH_NO_LOOPS, IGRAPH_NO_MULTIPLE)… in igraph_maximum_cardinality_search()
102 IGRAPH_FINALLY(igraph_adjlist_destroy, &adjlist); in igraph_maximum_cardinality_search()
166 neis = igraph_adjlist_get(&adjlist, v); in igraph_maximum_cardinality_search()
228 igraph_adjlist_destroy(&adjlist); in igraph_maximum_cardinality_search()
291 igraph_adjlist_t adjlist; in igraph_is_chordal() local
352 …IGRAPH_CHECK(igraph_adjlist_init(graph, &adjlist, IGRAPH_ALL, IGRAPH_NO_LOOPS, IGRAPH_NO_MULTIPLE)… in igraph_is_chordal()
353 IGRAPH_FINALLY(igraph_adjlist_destroy, &adjlist); in igraph_is_chordal()
384 neis = igraph_adjlist_get(&adjlist, w); in igraph_is_chordal()
457 igraph_adjlist_destroy(&adjlist); in igraph_is_chordal()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/CutPool/
H A Dcnrp_cp.c536 pool_edge *adjlist; local
552 adjlist = n->adjlist;
584 verts[nv0].first = adjlist;
587 verts[nv0].first = adjlist;
589 adjlist->other_end = nv1;
591 adjlist++;
593 verts[nv1].first = adjlist;
596 verts[nv1].first = adjlist;
598 adjlist->other_end = nv0;
600 adjlist++;
[all …]

123456