Home
last modified time | relevance | path

Searched defs:directed (Results 1 – 25 of 457) sorted by relevance

12345678910>>...19

/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/tests/
H A Dutility_functions.py8 def build_simple_test_graph(directed=False): argument
32 def build_single_node_graph(directed=False): argument
43 def build_2_node_graph(directed=False): argument
57 def build_3_node_line_graph(directed=False): argument
74 def build_3_node_line_root_articulation_graph(directed=False): argument
91 def build_biconnected_test_graph(directed=False): argument
155 def build_triangle_graph_with_costs(directed=False): argument
173 def build_square_test_graph_with_costs(directed=False): argument
192 def build_complicated_test_graph_with_one_mst(directed=False): argument
/dports/science/py-scipy/scipy-1.7.1/scipy/sparse/csgraph/tests/
H A Dtest_shortest_path.py151 def test_dijkstra_indices_min_only(directed, SP_ans, indices): argument
221 def check(method, directed): argument
234 def check(method, directed): argument
248 def check(method, directed): argument
270 def check(method, directed): argument
/dports/math/igraph/igraph-0.9.5/src/games/
H A Dtree.c36 static int igraph_i_tree_game_prufer(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed) { in igraph_i_tree_game_prufer()
77 …_i_tree_game_loop_erased_random_walk(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed) { in igraph_i_tree_game_loop_erased_random_walk()
178 int igraph_tree_game(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed, igraph_random_tre… in igraph_tree_game()
H A Derdos_renyi.c40 igraph_bool_t directed, igraph_bool_t loops in igraph_erdos_renyi_game_gnp()
137 igraph_bool_t directed, igraph_bool_t loops in igraph_erdos_renyi_game_gnm()
273 igraph_bool_t directed, igraph_bool_t loops) { in igraph_erdos_renyi_game()
/dports/science/py-pygeodesy/PyGeodesy-21.9.16/pygeodesy/
H A Dhausdorff.py272 directed = Hausdorff.directed variable in HausdorffDegrees
284 directed = Hausdorff.directed variable in HausdorffRadians
335 directed = Hausdorff.directed variable in HausdorffCosineAndoyerLambert
381 directed = Hausdorff.directed variable in HausdorffCosineForsytheAndoyerLambert
423 directed = Hausdorff.directed variable in HausdorffCosineLaw
475 directed = Hausdorff.directed variable in HausdorffDistanceTo
527 directed = Hausdorff.directed variable in HausdorffEquirectangular
572 directed = Hausdorff.directed variable in HausdorffEuclidean
625 directed = Hausdorff.directed variable in HausdorffExact
675 directed = Hausdorff.directed variable in HausdorffFlatLocal
[all …]
/dports/math/R-cran-igraph/igraph/R/
H A Dgames.R115 directed=TRUE, algorithm=c("psumtree", argument
217 sample_gnp <- function(n, p, directed = FALSE, loops = FALSE) { argument
272 sample_gnm <- function(n, m, directed = FALSE, loops = FALSE) { argument
342 directed=FALSE, loops=FALSE) { argument
614 out.pref=FALSE, directed=TRUE, argument
751 directed=FALSE) { argument
781 directed=FALSE) { argument
913 directed=FALSE, loops=FALSE) { argument
1090 directed=TRUE) { argument
1114 directed=TRUE, attr=TRUE) { argument
[all …]
H A Dmake.R558 old_graph <- function(edges, n = max(edges), directed = TRUE) { argument
569 if (!missing(directed)) args <- c(args, list(directed = directed)) nameattr
653 make_empty_graph <- function(n=0, directed=TRUE) { argument
819 directed <- FALSE functionVar
965 make_full_graph <- function(n, directed=FALSE, loops=FALSE) { argument
1015 nei = 1, directed = FALSE, mutual = FALSE, argument
1070 make_ring <- function(n, directed=FALSE, mutual=FALSE, circular=TRUE) { argument
1212 make_chordal_ring <- function(n, w, directed=FALSE) { argument
1413 make_full_bipartite_graph <- function(n1, n2, directed=FALSE, argument
1480 make_bipartite_graph <- function(types, edges, directed=FALSE) { argument
[all …]
H A Dincidence.R25 graph.incidence.sparse <- function(incidence, directed, mode, multiple, argument
78 graph.incidence.dense <- function(incidence, directed, mode, multiple, argument
197 graph_from_incidence_matrix <- function(incidence, directed=FALSE, argument
H A Ddata_frame.R118 graph_from_data_frame <- function(d, directed=TRUE, vertices=NULL) { argument
227 graph_from_edgelist <- function(el, directed=TRUE) { argument
H A Dforeign.R207 directed=TRUE, ...) { argument
232 directed=FALSE, ...) { argument
260 directed=FALSE, argument
312 read.graph.dimacs <- function(file, directed=TRUE, ...) { argument
406 read.graph.dl <- function(file, directed=TRUE, ...) { argument
499 compressed=TRUE, directed=TRUE) { argument
547 read.graph.graphdb <- function(file, directed=TRUE, ...) { argument
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/community/tests/
H A Dtest_lukes.py13 def paper_1_case(float_edge_wt=False, explicit_node_wt=True, directed=False): argument
52 def paper_2_case(explicit_edge_wt=True, directed=False): argument
/dports/deskutils/egroupware/egroupware/vendor/pear/structures_graph/Structures/
H A DGraph.php74 public function __construct($directed = true)
87 public function Structures_Graph($directed = true)
/dports/www/tikiwiki/tiki-21.2/vendor_bundled/vendor/pear/structures_graph/Structures/
H A DGraph.php74 public function __construct($directed = true)
87 public function Structures_Graph($directed = true)
/dports/math/igraph/igraph-0.9.5/src/constructors/
H A Dbasic_constructors.c67 igraph_integer_t n, igraph_bool_t directed) { in igraph_create()
128 int igraph_small(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed, in igraph_small()
H A Dfull.c63 int igraph_full(igraph_t *graph, igraph_integer_t n, igraph_bool_t directed, in igraph_full()
138 igraph_bool_t directed) { in igraph_full_citation()
/dports/math/igraph/igraph-0.9.5/src/centrality/
H A Dcentralization.c212 igraph_bool_t directed = mode != IGRAPH_ALL; in igraph_centralization_degree_tmax() local
284 igraph_bool_t directed, in igraph_centralization_betweenness()
356 igraph_bool_t directed, in igraph_centralization_betweenness_tmax()
551 igraph_bool_t directed, in igraph_centralization_eigenvector_centrality()
638 igraph_bool_t directed, in igraph_centralization_eigenvector_centrality_tmax()
/dports/math/R-cran-igraph/igraph/tests/testthat/
H A Dtest_indexing.R106 expect_that(g[[, 2, directed=FALSE]], globalVar
108 expect_that(g[[2, directed=FALSE]], globalVar
122 expect_that(g[[, 'b', directed=FALSE]], globalVar
124 expect_that(g[['b', directed=FALSE]], globalVar
186 expect_that(g[[, 2, directed=FALSE, edges=TRUE]], globalVar
188 expect_that(g[[2, directed=FALSE, edges=TRUE]], globalVar
204 expect_that(g[[, 'b', directed=FALSE, edges=TRUE]], globalVar
206 expect_that(g[['b', directed=FALSE, edges=TRUE]], globalVar
/dports/math/vtk6/VTK-6.2.0/Infovis/Parallel/
H A DvtkPBGLDistributedGraphHelper.cxx420 bool directed, in AddEdgeInternal()
574 bool directed, in AddEdgeInternal()
641 bool directed, in AddEdgeInternal()
690 bool directed, in AddEdgeInternal()
976 (vtkEdgeType edge, bool directed) in HandleAddBackEdge()
1004 (const EdgeIIMessageBundle& msg, bool directed) in HandleAddEdge()
1025 (const EdgeNIMessageBundle& msg, bool directed) in HandleAddEdgeNI()
1045 (const EdgeINMessageBundle& msg, bool directed) in HandleAddEdgeIN()
1064 (const EdgeNNMessageBundle& msg, bool directed) in HandleAddEdgeNN()
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Dshortest_paths.c44 const igraph_bool_t directed, in igraph_i_average_path_length_unweighted()
149 const igraph_bool_t directed, in igraph_i_average_path_length_dijkstra()
317 igraph_bool_t directed, igraph_bool_t unconn) in igraph_average_path_length()
370 igraph_bool_t directed, igraph_bool_t unconn) in igraph_average_path_length_dijkstra()
421 igraph_bool_t directed) in igraph_global_efficiency()
703 igraph_bool_t directed, igraph_neimode_t mode) in igraph_local_efficiency()
858 igraph_bool_t directed, igraph_neimode_t mode) in igraph_average_local_efficiency()
931 igraph_bool_t directed, igraph_bool_t unconn) { in igraph_diameter()
1099 igraph_bool_t directed, in igraph_diameter_dijkstra()
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dmodularity.c117 const igraph_bool_t directed, in igraph_modularity()
221 const igraph_vector_t *weights, igraph_bool_t directed) { in igraph_i_modularity_matrix_get_adjacency()
303 igraph_bool_t directed) { in igraph_modularity_matrix()
/dports/science/py-scipy/scipy-1.7.1/scipy/sparse/csgraph/
H A D_tools.pyx410 def reconstruct_path(csgraph, predecessors, directed=True): argument
500 directed=True, argument
589 int directed,
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/simple_graph/
H A Dsimple_graph.cc13 GraphDirected directed, bool stats) in outputGraph()
62 GraphDirected directed = GraphDirected_no; in main() local
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dmixing.c65 igraph_bool_t directed) { in igraph_assortativity_nominal()
176 igraph_bool_t directed) { in igraph_assortativity()
276 igraph_bool_t directed) { in igraph_assortativity_degree()
/dports/math/R-cran-igraph/igraph/src/
H A Dmixing.c64 igraph_bool_t directed) { in igraph_assortativity_nominal()
175 igraph_bool_t directed) { in igraph_assortativity()
275 igraph_bool_t directed) { in igraph_assortativity_degree()
/dports/math/vtk6/VTK-6.2.0/IO/Legacy/
H A DvtkGraphReader.cxx106 bool directed = true; in RequestData() local
281 int vtkGraphReader::ReadGraphDirectedness(bool & directed) in ReadGraphDirectedness()
340 bool directed = true; in RequestDataObject() local

12345678910>>...19