Home
last modified time | relevance | path

Searched refs:IGRAPH_OUT (Results 1 – 25 of 143) sorted by relevance

123456

/dports/math/igraph/igraph-0.9.5/tests/benchmarks/
H A Digraph_random_walk.c26 …igraph_random_edge_walk(&graph, NULL, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK_RET… in main()
30 …igraph_random_edge_walk(&graph, &weights, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK… in main()
34 … igraph_random_walk(&graph, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK_RETURN) in main()
40 …igraph_random_edge_walk(&graph, NULL, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK_RET… in main()
44 …igraph_random_edge_walk(&graph, &weights, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK… in main()
48 … igraph_random_walk(&graph, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK_RETURN) in main()
63 …igraph_random_edge_walk(&graph, NULL, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK_RET… in main()
67 …igraph_random_edge_walk(&graph, &weights, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK… in main()
71 … igraph_random_walk(&graph, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK_RETURN) in main()
77 …igraph_random_edge_walk(&graph, NULL, &walk, 0, IGRAPH_OUT, 50000000, IGRAPH_RANDOM_WALK_STUCK_RET… in main()
[all …]
H A Digraph_closeness_weighted.c40 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, NULL, 1), RE… in main()
49 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, &weight, 1),… in main()
66 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, NULL, 1), RE… in main()
75 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, &weight, 1),… in main()
97 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, NULL, 1), RE… in main()
106 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, &weight, 1),… in main()
125 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, NULL, 1), RE… in main()
134 …REPEAT(igraph_closeness(&graph, &closeness, NULL, NULL, igraph_vss_all(), IGRAPH_OUT, &weight, 1),… in main()
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Dadjlist.c30 igraph_adjlist_init(&g, &adjlist, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTIPLE); in test_simple_trees()
31 igraph_adjlist(&g2, &adjlist, IGRAPH_OUT, /*duplicate=*/ 0); in test_simple_trees()
50 igraph_adjlist_init(&g, &adjlist, IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_MULTIPLE); in test_simple_trees()
98 TEST_ADJLIST("Loops listed twice", IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_MULTIPLE); in test_loop_elimination_for_undirected_graph()
108 TEST_LAZY_ADJLIST("Loops listed twice", IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_MULTIPLE); in test_loop_elimination_for_undirected_graph()
139 TEST_ADJLIST("Out-edges, loops eliminated", IGRAPH_OUT, IGRAPH_NO_LOOPS, IGRAPH_MULTIPLE); in test_loop_elimination_for_directed_graph()
142 IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_MULTIPLE); in test_loop_elimination_for_directed_graph()
160 IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_MULTIPLE); in test_loop_elimination_for_directed_graph()
197 TEST_ADJLIST("Loops listed twice", IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_NO_MULTIPLE); in test_multiedge_elimination_for_undirected_graph()
244 IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_NO_MULTIPLE); in test_multiedge_elimination_for_directed_graph()
[all …]
H A Dinclist.c68 TEST_INCLIST("Loops listed twice", IGRAPH_OUT, IGRAPH_LOOPS_TWICE); in test_loop_elimination_for_undirected_graph()
78 TEST_LAZY_INCLIST("Loops listed twice", IGRAPH_OUT, IGRAPH_LOOPS_TWICE); in test_loop_elimination_for_undirected_graph()
117 TEST_INCLIST("Out-edges, loops eliminated", IGRAPH_OUT, IGRAPH_NO_LOOPS); in test_loop_elimination_for_directed_graph()
118 TEST_INCLIST("Out-edges, loops listed once", IGRAPH_OUT, IGRAPH_LOOPS_ONCE); in test_loop_elimination_for_directed_graph()
120 IGRAPH_OUT, IGRAPH_LOOPS_TWICE); in test_loop_elimination_for_directed_graph()
135 TEST_LAZY_INCLIST("Out-edges, loops eliminated", IGRAPH_OUT, IGRAPH_NO_LOOPS); in test_loop_elimination_for_directed_graph()
136 TEST_LAZY_INCLIST("Out-edges, loops listed once", IGRAPH_OUT, IGRAPH_LOOPS_ONCE); in test_loop_elimination_for_directed_graph()
138 IGRAPH_OUT, IGRAPH_LOOPS_TWICE); in test_loop_elimination_for_directed_graph()
H A Digraph_eccentricity.c33 igraph_eccentricity(&g, &ecc, igraph_vss_all(), IGRAPH_OUT); in main()
39 igraph_eccentricity(&g, &ecc, igraph_vss_all(), IGRAPH_OUT); in main()
47 igraph_eccentricity(&g, &ecc, igraph_vss_all(), IGRAPH_OUT); in main()
53 igraph_eccentricity(&g, &ecc, igraph_vss_all(), IGRAPH_OUT); in main()
59 igraph_eccentricity(&g, &ecc, igraph_vss_all(), IGRAPH_OUT); in main()
65 igraph_eccentricity(&g, &ecc, igraph_vss_all(), IGRAPH_OUT); in main()
77 igraph_eccentricity(&g, &ecc, igraph_vss_all(), IGRAPH_OUT); in main()
H A Dbfs.c57 igraph_bfs(&graph, /*root=*/0, /*roots=*/ 0, /*neimode=*/ IGRAPH_OUT, in main()
79 igraph_bfs(&graph, /*root=*/ 0, /*roots=*/ 0, /*neimode=*/ IGRAPH_OUT, in main()
87 igraph_bfs(&graph, /*root=*/ 2, /*roots=*/ 0, /*neimode=*/ IGRAPH_OUT, in main()
99 igraph_bfs(&graph, /*root=*/ 5, /*roots=*/ 0, /*neimode=*/ IGRAPH_OUT, in main()
107 igraph_bfs(&graph, /*root=*/ 4, /*roots=*/ 0, /*neimode=*/ IGRAPH_OUT, in main()
113 igraph_bfs(&graph, /*root=*/ 3, /*roots=*/ 0, /*neimode=*/ IGRAPH_OUT, in main()
125 igraph_bfs(&graph, /*root=*/ -1, &roots, /*neimode=*/ IGRAPH_OUT, in main()
H A Digraph_i_incident.out5 Vertex with multiple edges, IGRAPH_OUT, IGRAPH_MULTIPLE:
13 Vertex with multiple edges, IGRAPH_OUT, IGRAPH_NO_MULTIPLE:
19 Vertex 1 with loop, IGRAPH_OUT, IGRAPH_NO_LOOPS:
25 Vertex 1 with loop, IGRAPH_OUT, IGRAPH_LOOPS_ONCE:
39 Trying IGRAPH_LOOPS_TWICE with IGRAPH_OUT:
H A Digraph_i_neighbors.out5 Vertex with multiple edges, IGRAPH_OUT, IGRAPH_MULTIPLE:
13 Vertex with multiple edges, IGRAPH_OUT, IGRAPH_NO_MULTIPLE:
19 Vertex 1 with loop, IGRAPH_OUT, IGRAPH_NO_LOOPS:
25 Vertex 1 with loop, IGRAPH_OUT, IGRAPH_LOOPS_ONCE:
39 Trying IGRAPH_LOOPS_TWICE with IGRAPH_OUT:
H A Digraph_i_incident.c51 call_and_print(&g_lm, 0, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTIPLE); in main()
63 call_and_print(&g_lm, 0, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_NO_MULTIPLE); in main()
72 call_and_print(&g_lm, 1, IGRAPH_OUT, IGRAPH_NO_LOOPS, IGRAPH_MULTIPLE); in main()
81 call_and_print(&g_lm, 1, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTIPLE); in main()
105 …IGRAPH_ASSERT(igraph_i_incident(&g_lm, &eids, 0, IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_NO_MULTIPL… in main()
108 …IGRAPH_ASSERT(igraph_i_neighbors(&g_lm, &eids, 100, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_NO_MULTI… in main()
H A Digraph_k_regular_game.c95 igraph_degree(&g, &deg, igraph_vss_all(), IGRAPH_OUT, 1); in main()
110 igraph_degree(&g, &deg, igraph_vss_all(), IGRAPH_OUT, 1); in main()
125 igraph_degree(&g, &deg, igraph_vss_all(), IGRAPH_OUT, 1); in main()
140 igraph_degree(&g, &deg, igraph_vss_all(), IGRAPH_OUT, 1); in main()
151 igraph_degree(&g, &deg, igraph_vss_all(), IGRAPH_OUT, 1); in main()
162 igraph_degree(&g, &deg, igraph_vss_all(), IGRAPH_OUT, 1); in main()
H A Dsingle_target_shortest_path.c45 igraph_get_shortest_path(&g, &vpath, &epath, 0, 4, IGRAPH_OUT); in main()
49 igraph_get_shortest_path(&g, &vpath, &epath, 0, 0, IGRAPH_OUT); in main()
54 igraph_get_shortest_path(&g, &vpath, &epath, 4, 0, IGRAPH_OUT); in main()
72 igraph_get_shortest_path_dijkstra(&g, &vpath, &epath, 0, 4, &w, IGRAPH_OUT); in main()
H A Digraph_i_neighbors.c51 call_and_print(&g_lm, 0, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTIPLE); in main()
63 call_and_print(&g_lm, 0, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_NO_MULTIPLE); in main()
72 call_and_print(&g_lm, 1, IGRAPH_OUT, IGRAPH_NO_LOOPS, IGRAPH_MULTIPLE); in main()
81 call_and_print(&g_lm, 1, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTIPLE); in main()
105 …IGRAPH_ASSERT(igraph_i_neighbors(&g_lm, &neis, 0, IGRAPH_OUT, IGRAPH_LOOPS_TWICE, IGRAPH_NO_MULTIP… in main()
H A Digraph_layout_reingold_tilford_circular.c51 …IGRAPH_ASSERT(igraph_layout_reingold_tilford_circular(&g, &result, IGRAPH_OUT, &roots, /*rootlevel… in main()
67 …IGRAPH_ASSERT(igraph_layout_reingold_tilford_circular(&g, &result, IGRAPH_OUT, &roots, NULL) == IG… in main()
77 …IGRAPH_ASSERT(igraph_layout_reingold_tilford_circular(&g, &result, IGRAPH_OUT, &roots, &rootlevel)… in main()
98 …IGRAPH_ASSERT(igraph_layout_reingold_tilford_circular(&g, &result, IGRAPH_OUT, &roots, /*rootlevel… in main()
108 …IGRAPH_ASSERT(igraph_layout_reingold_tilford_circular(&g, &result, IGRAPH_OUT, &roots, &rootlevel)… in main()
H A Dtopological_sorting.c48 igraph_topological_sorting(&g, &res, IGRAPH_OUT); in main()
64 ret = igraph_topological_sorting(&g, &res, IGRAPH_OUT); in main()
87 ret = igraph_topological_sorting(&g, &res, IGRAPH_OUT); in main()
H A Defficiency.c45 igraph_average_local_efficiency(&graph, &eff, NULL, 1, IGRAPH_OUT); in main()
61 igraph_local_efficiency(&graph, &eff_vec, igraph_vss_all(), NULL, 1, IGRAPH_OUT); in main()
82 igraph_average_local_efficiency(&graph, &eff, &weights, 1, IGRAPH_OUT); in main()
98 igraph_local_efficiency(&graph, &eff_vec, igraph_vss_all(), &weights, 1, IGRAPH_OUT); in main()
H A Digraph_random_walk.c22 …igraph_random_edge_walk(&graph, NULL, &walk, 0, IGRAPH_OUT, 1000, IGRAPH_RANDOM_WALK_STUCK_RETURN); in main()
35 …igraph_random_edge_walk(&graph, &weights, &walk, 0, IGRAPH_OUT, 1000, IGRAPH_RANDOM_WALK_STUCK_RET… in main()
46 …igraph_random_edge_walk(&graph, NULL, &walk, 0, IGRAPH_OUT, 1000, IGRAPH_RANDOM_WALK_STUCK_RETURN); in main()
H A Dtree_game.c32 IGRAPH_ASSERT(igraph_is_tree(&graph, &is_tree, NULL, IGRAPH_OUT) == IGRAPH_SUCCESS); in main()
37 IGRAPH_ASSERT(igraph_is_tree(&graph, &is_tree, NULL, IGRAPH_OUT) == IGRAPH_SUCCESS); in main()
44 IGRAPH_ASSERT(igraph_is_tree(&graph, &is_tree, NULL, IGRAPH_OUT) == IGRAPH_SUCCESS); in main()
H A Digraph_is_tree.c63 igraph_is_tree(&g, &res, &root, IGRAPH_OUT); in main()
86 igraph_is_tree(&g, &res, &root, IGRAPH_OUT); in main()
108 igraph_is_tree(&g, &res, &root, IGRAPH_OUT); in main()
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Digraph_degree_sequence_game.c21 if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) { in main()
35 if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 0)) { in main()
46 if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) { in main()
64 if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) { in main()
78 if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) { in main()
H A Ddominator_tree.c51 /*leftout=*/ 0, /*mode=*/ IGRAPH_OUT); in main()
55 /*leftout=*/ 0, /*mode=*/ IGRAPH_OUT); in main()
60 /*leftout=*/ 0, /*mode=*/ IGRAPH_OUT); in main()
127 &leftout, /*mode=*/ IGRAPH_OUT); in main()
H A Digraph_degree.c55 igraph_degree(&g, &v, igraph_vss_all(), IGRAPH_OUT, IGRAPH_NO_LOOPS); in main()
58 igraph_degree(&g, &v, igraph_vss_all(), IGRAPH_OUT, IGRAPH_LOOPS); in main()
99 igraph_degree(&g, &v, igraph_vss_all(), IGRAPH_OUT, IGRAPH_NO_LOOPS); in main()
102 igraph_degree(&g, &v, igraph_vss_all(), IGRAPH_OUT, IGRAPH_LOOPS); in main()
192 igraph_maxdegree(&g, &mdeg, igraph_vss_all(), IGRAPH_OUT, IGRAPH_LOOPS); in main()
H A Dbellman_ford.c75 &weights, IGRAPH_OUT); in main()
94 igraph_vss_all(), &weights, IGRAPH_OUT); in main()
105 &weights, IGRAPH_OUT) != IGRAPH_ENEGLOOP) { in main()
H A Digraph_get_all_shortest_paths_dijkstra.c125 /*weights=*/ NULL, /*mode=*/ IGRAPH_OUT); in main()
142 /*weights=*/ &weights_vec, /*mode=*/ IGRAPH_OUT); in main()
170 /*weights=*/ &weights_vec, /*mode=*/ IGRAPH_OUT); in main()
200 /*weights=*/ &weights_vec, /*mode=*/ IGRAPH_OUT); in main()
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Djohnson.c85 return igraph_shortest_paths(graph, res, from, to, IGRAPH_OUT); in igraph_shortest_paths_johnson()
94 return igraph_shortest_paths(graph, res, from, to, IGRAPH_OUT); in igraph_shortest_paths_johnson()
105 weights, IGRAPH_OUT); in igraph_shortest_paths_johnson()
148 igraph_vss_all(), &newweights, IGRAPH_OUT)); in igraph_shortest_paths_johnson()
167 IGRAPH_OUT)); in igraph_shortest_paths_johnson()
/dports/math/igraph/igraph-0.9.5/src/properties/
H A Dmultiplicity.c62 IGRAPH_CHECK(igraph_neighbors(graph, &neis, (igraph_integer_t) i, IGRAPH_OUT)); in igraph_is_simple()
116 IGRAPH_OUT)); in igraph_has_multiple()
178 IGRAPH_CHECK(igraph_lazy_inclist_init(graph, &inclist, IGRAPH_OUT, IGRAPH_LOOPS_ONCE)); in igraph_is_multiple()
245 IGRAPH_CHECK(igraph_lazy_inclist_init(graph, &inclist, IGRAPH_OUT, IGRAPH_LOOPS_ONCE)); in igraph_count_multiple()
331 …IGRAPH_CHECK(igraph_lazy_adjlist_init(graph, &adjlist, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTI… in igraph_is_mutual()

123456