Home
last modified time | relevance | path

Searched refs:IGRAPH_WEAK (Results 1 – 25 of 34) sorted by relevance

12

/dports/math/igraph/igraph-0.9.5/tests/benchmarks/
H A Digraph_decompose.c17 igraph_decompose(&g, &res, IGRAPH_WEAK, -1, -1); in main()
25 igraph_decompose(&g, &res, IGRAPH_WEAK, -1, -1); in main()
33 igraph_decompose(&g, &res, IGRAPH_WEAK, -1, -1); in main()
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Digraph_decompose.c28 igraph_decompose(&ring, &complist, IGRAPH_WEAK, -1, 0); in main()
36 igraph_decompose(&g, &complist, IGRAPH_WEAK, -1, 20); in main()
47 igraph_decompose(&g, &complist, IGRAPH_WEAK, 3, 2); in main()
/dports/math/igraph/igraph-0.9.5/src/community/spinglass/
H A Dclustertool.cpp300 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_i_community_spinglass_orig()
473 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_community_spinglass_single()
587 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_i_community_spinglass_negative()
/dports/math/R-cran-igraph/igraph/src/
H A Dclustertool.cpp284 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_i_community_spinglass_orig()
483 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_community_spinglass_single()
601 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_i_community_spinglass_negative()
H A Dwalktrap.cpp143 &no, IGRAPH_WEAK)); in igraph_community_walktrap()
H A Dcomponents.c77 if (mode == IGRAPH_WEAK || !igraph_is_directed(graph)) { in igraph_clusters()
361 if (mode == IGRAPH_WEAK || !igraph_is_directed(graph)) { in igraph_is_connected()
516 if (mode == IGRAPH_WEAK || !igraph_is_directed(graph)) { in igraph_decompose()
H A Dspanning_trees.c484 IGRAPH_CHECK(igraph_clusters(graph, &membership, &csize, &comp_count, IGRAPH_WEAK)); in igraph_random_spanning_tree()
H A Dlayout_fr.c52 igraph_is_connected(graph, &conn, IGRAPH_WEAK); in igraph_layout_i_fr()
549 igraph_is_connected(graph, &conn, IGRAPH_WEAK); in igraph_layout_fruchterman_reingold_3d()
H A Dlayout.c1213 &no_comps, IGRAPH_WEAK)); in igraph_layout_reingold_tilford()
1218 &no_comps, IGRAPH_WEAK)); in igraph_layout_reingold_tilford()
2382 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_layout_mds()
/dports/math/igraph/igraph-0.9.5/src/community/walktrap/
H A Dwalktrap.cpp143 &no, IGRAPH_WEAK)); in igraph_community_walktrap()
/dports/math/R-cran-igraph/igraph/src/include/
H A Digraph_constants.h51 typedef enum { IGRAPH_WEAK = 1, IGRAPH_STRONG = 2 } igraph_connectedness_t; enumerator
/dports/math/igraph/igraph-0.9.5/include/
H A Digraph_constants.h55 typedef enum { IGRAPH_WEAK = 1, IGRAPH_STRONG = 2 } igraph_connectedness_t; enumerator
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Dring.c107 igraph_is_connected(ring, &res, IGRAPH_WEAK); in check_ring_properties()
H A Digraph_lattice.c114 igraph_is_connected(lattice, &res, IGRAPH_WEAK); in check_lattice_properties()
H A Digraph_gomory_hu_tree.c94 IGRAPH_CHECK(igraph_clusters(&copy, &membership, 0, &no_of_clusters, IGRAPH_WEAK)); in validate_tree()
H A Digraph_degree_sequence_game.c177 igraph_is_connected(&g, &is_connected, IGRAPH_WEAK); in main()
/dports/math/igraph/igraph-0.9.5/src/properties/
H A Dgirth.c98 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_girth()
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Deulerian.c68 IGRAPH_CHECK(igraph_clusters(graph, NULL, &csize, NULL, IGRAPH_WEAK)); in igraph_i_is_eulerian_undirected()
193 IGRAPH_CHECK(igraph_clusters(graph, NULL, &csize, NULL, IGRAPH_WEAK)); in igraph_i_is_eulerian_directed()
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dfluid.c102 igraph_is_connected(graph, &res, IGRAPH_WEAK); in igraph_community_fluid_communities()
H A Dedge_betweenness.c87 IGRAPH_WEAK)); in igraph_i_community_eb_get_merges2()
259 IGRAPH_CHECK(igraph_clusters(graph, 0, 0, &no_comps, IGRAPH_WEAK)); in igraph_community_eb_get_merges()
/dports/math/igraph/igraph-0.9.5/src/connectivity/
H A Dcomponents.c81 if (mode == IGRAPH_WEAK || !igraph_is_directed(graph)) { in igraph_clusters()
369 if (mode == IGRAPH_WEAK || !igraph_is_directed(graph)) { in igraph_is_connected()
523 if (mode == IGRAPH_WEAK || !igraph_is_directed(graph)) { in igraph_decompose()
/dports/math/igraph/igraph-0.9.5/src/layout/
H A Dmds.c219 IGRAPH_CHECK(igraph_is_connected(graph, &conn, IGRAPH_WEAK)); in igraph_layout_mds()
H A Dfruchterman_reingold.c53 igraph_is_connected(graph, &conn, IGRAPH_WEAK); in igraph_layout_i_fr()
550 igraph_is_connected(graph, &conn, IGRAPH_WEAK); in igraph_layout_fruchterman_reingold_3d()
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dspanning_trees.c478 IGRAPH_CHECK(igraph_clusters(graph, &membership, &csize, &comp_count, IGRAPH_WEAK)); in igraph_random_spanning_tree()
H A Dfeedback_arc_set.c462 IGRAPH_WEAK)); in igraph_i_feedback_arc_set_ip()

12