/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | igraph_realize_degree_sequence.out | 5 directed: false 10 directed: false 15 directed: false 22 directed: false 27 directed: false 32 directed: false 39 directed: false 44 directed: false 49 directed: false 59 directed: false [all …]
|
H A D | efficiency.out | 4 Global efficiency, directed: 0.274786 6 Average local efficiency, directed, all neighbors: 0.329936 7 Average local efficiency, directed, in-neighbors: 0.212115 8 Average local efficiency, directed, out-neighbors: 0.149466 13 Local efficiency, directed, all neighbors: 16 Local efficiency, directed, in-neighbors: 19 Local efficiency, directed, out-neighbors: 26 Global efficiency, directed: 0.125356 35 Local efficiency, directed, all neighbors: 38 Local efficiency, directed, in-neighbors: [all …]
|
H A D | igraph_neighborhood_graphs.out | 5 directed: true 16 directed: true 24 directed: true 31 directed: true 38 directed: true 47 directed: true 56 directed: true 62 directed: true 68 directed: true 74 directed: true [all …]
|
/dports/devel/p5-Parse-RecDescent/Parse-RecDescent-1.967015/demo/ |
H A D | demo_dot.pl | 97 OK /var/src/gv1.5/graphs/directed/KW91.dot 98 OK /var/src/gv1.5/graphs/directed/NaN.dot 100 OK /var/src/gv1.5/graphs/directed/alf.dot 110 OK /var/src/gv1.5/graphs/directed/dfa.dot 111 OK /var/src/gv1.5/graphs/directed/fig6.dot 112 OK /var/src/gv1.5/graphs/directed/fsm.dot 118 OK /var/src/gv1.5/graphs/directed/mike.dot 120 OK /var/src/gv1.5/graphs/directed/nhg.dot 127 OK /var/src/gv1.5/graphs/directed/rowe.dot 133 OK /var/src/gv1.5/graphs/directed/tree.dot [all …]
|
/dports/devel/sgb/sgb-20090810_1/PROTOTYPES/ |
H A D | gb_basic.ch | 48 long directed; /* should the graph be directed? */ 61 long directed; /* should the graph be directed? */ 74 long directed; /* should the graph be directed? */ 87 long directed; /* should the graph be directed? */ 111 long directed; /* should the graph be directed? */ 124 long directed; /* should the graph be directed? */ 137 long directed; /* should the graph be directed? */ 150 long directed; /* should the graph be directed? */ 162 long directed; /* should the graph be directed? */ 173 long directed; /* should the graph be directed? */ [all …]
|
/dports/devel/sgb/sgb-20090810_1/ |
H A D | gb_basic.ch | 48 long directed; /* should the graph be directed? */ 61 long directed; /* should the graph be directed? */ 74 long directed; /* should the graph be directed? */ 87 long directed; /* should the graph be directed? */ 111 long directed; /* should the graph be directed? */ 124 long directed; /* should the graph be directed? */ 137 long directed; /* should the graph be directed? */ 150 long directed; /* should the graph be directed? */ 162 long directed; /* should the graph be directed? */ 173 long directed; /* should the graph be directed? */ [all …]
|
/dports/math/py-pynauty/pynauty-1.0.2/src/pynauty/tests/ |
H A D | conftest.py | 20 Graph(number_of_vertices=25, directed=False, 61 Graph(number_of_vertices=35, directed=False, 109 Graph(number_of_vertices=52, directed=False, 179 Graph(number_of_vertices=25, directed=False, 219 Graph(number_of_vertices=35, directed=False, 267 Graph(number_of_vertices=52, directed=False, 539 Graph(number_of_vertices=13, directed=False, 565 Graph(number_of_vertices=15, directed=False, 594 Graph(number_of_vertices=16, directed=False, 626 Graph(number_of_vertices=16, directed=False, [all …]
|
/dports/science/py-scipy/scipy-1.7.1/scipy/sparse/csgraph/tests/ |
H A D | test_shortest_path.py | 161 directed=directed, 168 directed=directed, 221 def check(method, directed): argument 222 SP, pred = shortest_path(directed_G, method, directed=directed, 234 def check(method, directed): argument 236 directed=directed, 239 SP2 = construct_dist_matrix(directed_G, pred, directed=directed) 248 def check(method, directed): argument 250 directed=directed, 254 directed=directed, [all …]
|
/dports/graphics/graphviz/graphviz-2.44.1/graphs/directed/ |
H A D | Makefile.am | 16 directeddir = $(graphdir)/directed directory 58 $(DOT) -Tdia -o$$i.dia $(top_srcdir)/graphs/directed/$$i; done 62 $(DOT) -Tfig -o$$i.fig $(top_srcdir)/graphs/directed/$$i; done 66 $(DOT) -Tgd -o$$i.gd $(top_srcdir)/graphs/directed/$$i; done 70 $(DOT) -Tgd2 -o$$i.gd2 $(top_srcdir)/graphs/directed/$$i; done 74 $(DOT) -Tgif -o$$i.gif $(top_srcdir)/graphs/directed/$$i; done 78 $(DOT) -Tgv -o$$i.gv $(top_srcdir)/graphs/directed/$$i; done 94 $(DOT) -Tjpg -o$$i.jpg $(top_srcdir)/graphs/directed/$$i; done 98 $(DOT) -Tmif -o$$i.mif $(top_srcdir)/graphs/directed/$$i; done 102 $(DOT) -Tmp -o$$i.mp $(top_srcdir)/graphs/directed/$$i; done [all …]
|
/dports/math/R-cran-igraph/igraph/R/ |
H A D | make.R | 507 directed = TRUE, dir = directed, simplify = TRUE) { argument 532 if (!missing(dir) && missing(directed)) directed <- dir 569 if (!missing(directed)) args <- c(args, list(directed = directed)) nameattr 580 res <- graph_from_edgelist(el, directed = directed) 664 directed <- as.logical(directed) 819 directed <- FALSE functionVar 821 directed <- TRUE 889 res <- graph( unname(ids[edges]), n=length(v), directed=directed) 1418 directed <- as.logical(directed) 1484 directed <- as.logical(directed) [all …]
|
H A D | incidence.R | 25 graph.incidence.sparse <- function(incidence, directed, mode, multiple, argument 41 if (!directed || mode==1) { 49 res <- make_empty_graph(n=n1+n2, directed=directed) 63 if (!directed || mode==1) { 72 res <- graph(n=n1+n2, edges, directed=directed) 92 if (directed && mode==3) { no.edges <- no.edges * 2 } 99 if (!directed || mode==1) { 120 res <- make_empty_graph(n=n1+n2, directed=directed) 202 directed <- as.logical(directed) 207 res <- graph.incidence.sparse(incidence, directed=directed, [all …]
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/tests/ |
H A D | utility_functions.py | 8 def build_simple_test_graph(directed=False): argument 10 if directed: 34 if directed: 43 def build_2_node_graph(directed=False): argument 45 if directed: 59 if directed: 76 if directed: 93 if directed: 157 if directed: 175 if directed: [all …]
|
/dports/math/igraph/igraph-0.9.5/src/games/ |
H A D | erdos_renyi.c | 40 igraph_bool_t directed, igraph_bool_t loops in igraph_erdos_renyi_game_gnp() argument 64 if (directed && loops) { in igraph_erdos_renyi_game_gnp() 66 } else if (directed && !loops) { in igraph_erdos_renyi_game_gnp() 68 } else if (!directed && loops) { in igraph_erdos_renyi_game_gnp() 92 if (directed && loops) { in igraph_erdos_renyi_game_gnp() 99 } else if (directed && !loops) { in igraph_erdos_renyi_game_gnp() 109 } else if (!directed && loops) { in igraph_erdos_renyi_game_gnp() 159 if (directed && loops) { in igraph_erdos_renyi_game_gnm() 161 } else if (directed && !loops) { in igraph_erdos_renyi_game_gnm() 163 } else if (!directed && loops) { in igraph_erdos_renyi_game_gnm() [all …]
|
/dports/databases/pgrouting/pgrouting-3.2.0/pgtap/withPoints/ |
H A D | many_to_many_eq_one_to_one_withPoint.test.sql | 12 directed := true, 21 directed := true, 30 directed := true, 39 directed := true, 51 directed := true, 60 directed := true, 69 directed := true, 78 directed := true, 90 directed := true, 110 directed := true, [all …]
|
/dports/databases/pgrouting/pgrouting-3.2.0/pgtap/traversal/depthFirstSearch/ |
H A D | edge_cases_undirected.sql | 21 5, directed => false 48 100, directed => false 64 4, directed => false, max_depth => -3 90 2, directed => false 116 ARRAY[3, 6], directed => false 123 ARRAY[3, 6], directed => false, max_depth => 0 130 ARRAY[3, 6], directed => false, max_depth => 1 196 ARRAY[3, 6, 8], directed => false 203 ARRAY[3, 6, 8], directed => false, max_depth => 1 261 ARRAY[5, 6, 10, 11], directed => false [all …]
|
H A D | equivalence_BFS.test.sql | 66 1, directed => false, max_depth => 1 73 2, directed => false, max_depth => 1 80 5, directed => false, max_depth => 1 87 1, directed => false, max_depth => 1 94 2, directed => false, max_depth => 1 101 5, directed => false, max_depth => 1 162 1, directed => false, max_depth => 2 169 2, directed => false, max_depth => 2 176 5, directed => false, max_depth => 2 183 1, directed => false, max_depth => 2 [all …]
|
/dports/math/R-cran-igraph/igraph/tests/testthat/ |
H A D | test_triangles.R | 8 g1 <- make_empty_graph(directed=TRUE) 9 g2 <- make_empty_graph(directed=FALSE) 13 g3 <- make_empty_graph(n=1, directed=TRUE) 14 g4 <- make_empty_graph(n=1, directed=FALSE) 18 g5 <- make_empty_graph(n=100, directed=TRUE) 19 g6 <- make_empty_graph(n=100, directed=FALSE) 23 g7 <- make_ring(3, directed=FALSE) 24 g8 <- make_ring(3, directed=TRUE) 30 g10 <- make_full_graph(5, directed=FALSE) 31 g11 <- make_full_graph(5, directed=TRUE)
|
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/utils/tests/ |
H A D | test_shortest_path.py | 17 def floyd_warshall_slow(graph, directed=False): argument 26 if not directed: 61 for directed in (True, False): 62 graph_FW = graph_shortest_path(dist_matrix, directed, "FW") 63 graph_py = floyd_warshall_slow(dist_matrix.copy(), directed) 72 for directed in (True, False): 73 graph_D = graph_shortest_path(dist_matrix, directed, "D") 84 for directed in (True, False): 85 if not directed: 101 dist_FW = graph_shortest_path(X, directed=False, method="FW") [all …]
|
/dports/math/R-cran-igraph/igraph/src/include/ |
H A D | igraph_games.h | 47 igraph_bool_t directed, 56 igraph_bool_t directed); 81 igraph_bool_t directed); 89 igraph_bool_t directed); 100 igraph_bool_t directed); 105 igraph_bool_t directed); 110 igraph_bool_t directed); 148 igraph_bool_t directed); 154 igraph_bool_t directed); 203 igraph_bool_t directed, [all …]
|
/dports/math/igraph/igraph-0.9.5/src/centrality/ |
H A D | centralization.c | 212 igraph_bool_t directed = mode != IGRAPH_ALL; in igraph_centralization_degree_tmax() local 216 directed = igraph_is_directed(graph); in igraph_centralization_degree_tmax() 222 if (directed) { in igraph_centralization_degree_tmax() 356 igraph_bool_t directed, in igraph_centralization_betweenness_tmax() argument 361 directed = directed && igraph_is_directed(graph); in igraph_centralization_betweenness_tmax() 367 if (directed) { in igraph_centralization_betweenness_tmax() 551 igraph_bool_t directed, in igraph_centralization_eigenvector_centrality() argument 580 graph, 0, directed, in igraph_centralization_eigenvector_centrality() 638 igraph_bool_t directed, in igraph_centralization_eigenvector_centrality_tmax() argument 644 directed = directed && igraph_is_directed(graph); in igraph_centralization_eigenvector_centrality_tmax() [all …]
|
/dports/databases/pgrouting/pgrouting-3.2.0/pgtap/ksp/ |
H A D | parallel.test.sql | 36 2, 3, 1, directed:=true 43 2, 3, 2, directed:=true 50 2, 3, 3, directed:=true 57 2, 3, 4, directed:=true 65 2, 3, 100, directed:=true 77 1, 4, 1, directed:=true 84 1, 4, 2, directed:=true 91 1, 4, 3, directed:=true 98 1, 4, 100, directed:=true
|
/dports/math/igraph/igraph-0.9.5/include/ |
H A D | igraph_games.h | 47 igraph_bool_t directed, 74 igraph_bool_t directed); 82 igraph_bool_t directed); 93 igraph_bool_t directed); 98 igraph_bool_t directed, 104 igraph_bool_t directed, 144 igraph_bool_t directed); 150 igraph_bool_t directed); 181 igraph_bool_t directed, igraph_bool_t loops); 199 igraph_bool_t directed, [all …]
|
/dports/math/graphthing/graphthing-1.3.2/src/ |
H A D | edge.cc | 13 flow (0), weight (wt), directed (dir), selected (false) in Edge() 21 directed (other.directed), selected (false) in Edge() 28 if (!directed) in cycle_orientations() 29 directed = true; in cycle_orientations() 32 directed = false; in cycle_orientations() 48 directed = other.directed; in operator =() 55 if (!directed) in operator ==() 65 (e.directed ? "-> \"" : "-- \"") in operator <<()
|
/dports/math/igraph/igraph-0.9.5/src/misc/ |
H A D | mixing.c | 65 igraph_bool_t directed) { in igraph_assortativity_nominal() argument 82 directed = directed && igraph_is_directed(graph); in igraph_assortativity_nominal() 100 if (!directed) { in igraph_assortativity_nominal() 114 if (!directed) { in igraph_assortativity_nominal() 176 igraph_bool_t directed) { in igraph_assortativity() argument 182 directed = directed && igraph_is_directed(graph); in igraph_assortativity() 184 if (!directed && types2) { in igraph_assortativity() 196 if (!directed) { in igraph_assortativity() 276 igraph_bool_t directed) { in igraph_assortativity_degree() argument 278 directed = directed && igraph_is_directed(graph); in igraph_assortativity_degree() [all …]
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | mixing.c | 64 igraph_bool_t directed) { in igraph_assortativity_nominal() argument 81 directed = directed && igraph_is_directed(graph); in igraph_assortativity_nominal() 99 if (!directed) { in igraph_assortativity_nominal() 113 if (!directed) { in igraph_assortativity_nominal() 175 igraph_bool_t directed) { in igraph_assortativity() argument 181 directed = directed && igraph_is_directed(graph); in igraph_assortativity() 183 if (!directed && types2) { in igraph_assortativity() 195 if (!directed) { in igraph_assortativity() 275 igraph_bool_t directed) { in igraph_assortativity_degree() argument 277 directed = directed && igraph_is_directed(graph); in igraph_assortativity_degree() [all …]
|