Home
last modified time | relevance | path

Searched defs:adjmatrix (Results 1 – 10 of 10) sorted by relevance

/dports/math/igraph/igraph-0.9.5/src/constructors/
H A Dadjacency.c58 static int igraph_i_adjacency_max(igraph_matrix_t *adjmatrix, igraph_vector_t *edges) { in igraph_i_adjacency_max()
80 static int igraph_i_adjacency_upper(igraph_matrix_t *adjmatrix, igraph_vector_t *edges) { in igraph_i_adjacency_upper()
114 static int igraph_i_adjacency_min(igraph_matrix_t *adjmatrix, igraph_vector_t *edges) { in igraph_i_adjacency_min()
195 int igraph_adjacency(igraph_t *graph, igraph_matrix_t *adjmatrix, in igraph_adjacency()
271 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_directed()
298 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_plus()
328 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_max()
358 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_upper()
384 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_lower()
410 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_min()
[all …]
/dports/math/R-cran-igraph/igraph/R/
H A Dadjacency.R25 graph.adjacency.dense <- function(adjmatrix, mode=c("directed", "undirected", "max", argument
83 graph.adjacency.sparse <- function(adjmatrix, mode=c("directed", "undirected", "max", argument
353 graph_from_adjacency_matrix <- function(adjmatrix, mode=c("directed", "undirected", "max", argument
H A Dsocnet.R539 .tkigraph.graph.adjacency <- function(adjmatrix, mode, weighted) { argument
/dports/math/R-cran-igraph/igraph/src/
H A Dstructure_generators.c132 static int igraph_i_adjacency_max(igraph_matrix_t *adjmatrix, igraph_vector_t *edges) { in igraph_i_adjacency_max()
154 static int igraph_i_adjacency_upper(igraph_matrix_t *adjmatrix, igraph_vector_t *edges) { in igraph_i_adjacency_upper()
188 static int igraph_i_adjacency_min(igraph_matrix_t *adjmatrix, igraph_vector_t *edges) { in igraph_i_adjacency_min()
270 int igraph_adjacency(igraph_t *graph, igraph_matrix_t *adjmatrix, in igraph_adjacency()
346 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_directed()
373 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_plus()
403 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_max()
433 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_upper()
459 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_lower()
485 const igraph_matrix_t *adjmatrix, in igraph_i_weighted_adjacency_min()
[all …]
H A Drinterface.c4628 SEXP R_igraph_graph_adjacency(SEXP adjmatrix, SEXP pmode) { in R_igraph_graph_adjacency()
4644 SEXP R_igraph_weighted_adjacency(SEXP adjmatrix, SEXP pmode, in R_igraph_weighted_adjacency()
/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/
H A Dfrom_adj_matrix.R73 adjmatrix = x, functionVar
/dports/math/R-cran-dimRed/dimRed/R/
H A Dgraph_embed.R267 adjmatrix = data.dist, functionVar
/dports/games/hyperrogue/hyperrogue-12.0f/
H A Dasonov.cpp158 EX transmatrix adjmatrix(int i) { in adjmatrix() function
H A Dnonisotropic.cpp372 transmatrix adjmatrix(int i, int j) { in adjmatrix() function
909 EX transmatrix adjmatrix(int i) { in adjmatrix() function
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dcons_cumulative.c11542 SCIP_Bool** adjmatrix, /**< adjacent matrix */ in transitiveClosure()