Home
last modified time | relevance | path

Searched refs:IGRAPH_EIT_GET (Results 1 – 25 of 46) sorted by relevance

12

/dports/math/igraph/igraph-0.9.5/src/properties/
H A Dspectral.c66 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
97 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
119 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
143 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
178 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
202 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
326 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
354 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
383 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
413 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
H A Dmultiplicity.c184 long int e = IGRAPH_EIT_GET(eit); in igraph_is_multiple()
251 long int e = IGRAPH_EIT_GET(eit); in igraph_count_multiple()
335 long int edge = IGRAPH_EIT_GET(eit); in igraph_is_mutual()
H A Dloops.c87 long int e = IGRAPH_EIT_GET(eit); in igraph_is_loop()
/dports/math/R-cran-igraph/igraph/src/
H A Dspectral_properties.c66 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
97 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
119 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
143 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
178 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
202 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_i_weighted_laplacian()
326 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
354 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
383 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
413 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_laplacian()
H A Dconversion.c87 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
100 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
121 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
142 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
219 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
227 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
239 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
251 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
302 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &from, &to); in igraph_get_edgelist()
310 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &from, &to); in igraph_get_edgelist()
[all …]
H A Dforeign.c1572 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_ncol()
1595 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_ncol()
1624 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_ncol()
1759 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_lgl()
1788 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_lgl()
2351 long int edge = IGRAPH_EIT_GET(eit); in igraph_write_graph_pajek()
3341 long int eid = IGRAPH_EIT_GET(it); in igraph_write_graph_leda()
3344 if (rev == IGRAPH_EIT_GET(it)) { in igraph_write_graph_leda()
3364 long int eid = IGRAPH_EIT_GET(it); in igraph_write_graph_leda()
3368 if (rev == IGRAPH_EIT_GET(it)) { in igraph_write_graph_leda()
[all …]
H A Dmicroscopic_update.c140 e = (igraph_integer_t)IGRAPH_EIT_GET(A); in igraph_ecumulative_proportionate_values()
163 e = (igraph_integer_t)IGRAPH_EIT_GET(A); in igraph_ecumulative_proportionate_values()
837 e = (igraph_integer_t)IGRAPH_EIT_GET(eA); in igraph_moran_process()
/dports/math/igraph/igraph-0.9.5/src/io/
H A Dleda.c196 long int eid = IGRAPH_EIT_GET(it); in igraph_write_graph_leda()
199 if (rev == IGRAPH_EIT_GET(it)) { in igraph_write_graph_leda()
219 long int eid = IGRAPH_EIT_GET(it); in igraph_write_graph_leda()
223 if (rev == IGRAPH_EIT_GET(it)) { in igraph_write_graph_leda()
240 igraph_edge(graph, IGRAPH_EIT_GET(it), &from, &to); in igraph_write_graph_leda()
242 if (rev == IGRAPH_EIT_GET(it)) { in igraph_write_graph_leda()
H A Dncol.c281 igraph_edge(graph, IGRAPH_EIT_GET(it), &from, &to); in igraph_write_graph_ncol()
299 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_ncol()
322 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_ncol()
351 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_ncol()
H A Dlgl.c265 igraph_edge(graph, IGRAPH_EIT_GET(it), &from, &to); in igraph_write_graph_lgl()
286 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_lgl()
315 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_lgl()
348 igraph_integer_t edge = IGRAPH_EIT_GET(it); in igraph_write_graph_lgl()
H A Dedgelist.c146 igraph_edge(graph, IGRAPH_EIT_GET(it), &from, &to); in igraph_write_graph_edgelist()
H A Ddimacs.c303 igraph_edge(graph, IGRAPH_EIT_GET(it), &from, &to); in igraph_write_graph_dimacs()
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dconversion.c92 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
105 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
126 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
147 long int edge = IGRAPH_EIT_GET(edgeit); in igraph_get_adjacency()
223 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
231 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
243 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
255 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto); in igraph_get_adjacency_sparse()
308 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &from, &to); in igraph_get_edgelist()
316 igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &from, &to); in igraph_get_edgelist()
[all …]
H A Dmicroscopic_update.c139 e = (igraph_integer_t)IGRAPH_EIT_GET(A); in igraph_i_ecumulative_proportionate_values()
162 e = (igraph_integer_t)IGRAPH_EIT_GET(A); in igraph_i_ecumulative_proportionate_values()
835 e = (igraph_integer_t)IGRAPH_EIT_GET(eA); in igraph_moran_process()
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Digraph_es_pairs.c45 (void) IGRAPH_EIT_GET(it); in main()
70 (void) IGRAPH_EIT_GET(it); in main()
H A Digraph_similarity.c76 long int eid = IGRAPH_EIT_GET(eit); in check_jaccard_all()
134 long int eid = IGRAPH_EIT_GET(eit); in check_dice_all()
H A Digraph_grg_game.c28 long int e = IGRAPH_EIT_GET(eit); in main()
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Digraph_es_path.c43 long int edge = IGRAPH_EIT_GET(eit); in main()
62 long int edge = IGRAPH_EIT_GET(eit); in main()
H A Dedge_selectors.c27 edge = IGRAPH_EIT_GET(eit); in check()
/dports/math/igraph/igraph-0.9.5/src/operators/
H A Dsimplify.c83 edge = IGRAPH_EIT_GET(eit); in igraph_simplify()
118 edge = IGRAPH_EIT_GET(eit); in igraph_simplify()
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dmodularity.c234 igraph_integer_t edge = IGRAPH_EIT_GET(edgeit); in igraph_i_modularity_matrix_get_adjacency()
244 igraph_integer_t edge = IGRAPH_EIT_GET(edgeit); in igraph_i_modularity_matrix_get_adjacency()
/dports/math/igraph/igraph-0.9.5/src/isomorphism/
H A Disomorphism_misc.c82 long int edge = IGRAPH_EIT_GET(eit); in igraph_simplify_and_colorize()
/dports/math/igraph/igraph-0.9.5/src/centrality/prpack/
H A Dprpack_igraph_graph.cpp51 eid = IGRAPH_EIT_GET(eit); in prpack_igraph_graph()
/dports/math/R-cran-igraph/igraph/src/prpack/
H A Dprpack_igraph_graph.cpp49 eid = IGRAPH_EIT_GET(eit); in prpack_igraph_graph()
/dports/math/igraph/igraph-0.9.5/include/
H A Digraph_iterators.h386 #define IGRAPH_EIT_GET(eit) \ macro

12