| /dports/math/suitesparse-btf/SuiteSparse-5.10.1/MATLAB_Tools/dimacs10/ |
| H A D | dimacs10.m | 17 % 'undirected multigraph'. S(i,j) is the # of edges (i,j). Only a
19 % 'undirected weighted graph'. S(i,j) is the weight of edge (i,j).
20 % 'undirected graph'. S is binary.
519 index.kind {id} = 'undirected graph' ;
522 index.kind {id} = 'undirected multigraph' ;
525 index.kind {id} = 'undirected weighted graph' ;
647 kind = 'undirected multigraph' ;
650 kind = 'undirected weighted graph' ;
653 kind = 'undirected graph' ;
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/MATLAB_Tools/dimacs10/ |
| H A D | dimacs10.m | 17 % 'undirected multigraph'. S(i,j) is the # of edges (i,j). Only a
19 % 'undirected weighted graph'. S(i,j) is the weight of edge (i,j).
20 % 'undirected graph'. S is binary.
519 index.kind {id} = 'undirected graph' ;
522 index.kind {id} = 'undirected multigraph' ;
525 index.kind {id} = 'undirected weighted graph' ;
647 kind = 'undirected multigraph' ;
650 kind = 'undirected weighted graph' ;
653 kind = 'undirected graph' ;
|
| /dports/math/suitesparse-spqr/SuiteSparse-5.10.1/MATLAB_Tools/dimacs10/ |
| H A D | dimacs10.m | 17 % 'undirected multigraph'. S(i,j) is the # of edges (i,j). Only a
19 % 'undirected weighted graph'. S(i,j) is the weight of edge (i,j).
20 % 'undirected graph'. S is binary.
519 index.kind {id} = 'undirected graph' ;
522 index.kind {id} = 'undirected multigraph' ;
525 index.kind {id} = 'undirected weighted graph' ;
647 kind = 'undirected multigraph' ;
650 kind = 'undirected weighted graph' ;
653 kind = 'undirected graph' ;
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/MATLAB_Tools/dimacs10/ |
| H A D | dimacs10.m | 17 % 'undirected multigraph'. S(i,j) is the # of edges (i,j). Only a
19 % 'undirected weighted graph'. S(i,j) is the weight of edge (i,j).
20 % 'undirected graph'. S is binary.
519 index.kind {id} = 'undirected graph' ;
522 index.kind {id} = 'undirected multigraph' ;
525 index.kind {id} = 'undirected weighted graph' ;
647 kind = 'undirected multigraph' ;
650 kind = 'undirected weighted graph' ;
653 kind = 'undirected graph' ;
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/MATLAB_Tools/dimacs10/ |
| H A D | dimacs10.m | 17 % 'undirected multigraph'. S(i,j) is the # of edges (i,j). Only a
19 % 'undirected weighted graph'. S(i,j) is the weight of edge (i,j).
20 % 'undirected graph'. S is binary.
519 index.kind {id} = 'undirected graph' ;
522 index.kind {id} = 'undirected multigraph' ;
525 index.kind {id} = 'undirected weighted graph' ;
647 kind = 'undirected multigraph' ;
650 kind = 'undirected weighted graph' ;
653 kind = 'undirected graph' ;
|
| /dports/math/R-cran-igraph/igraph/man/ |
| H A D | random_walk.Rd | 16 \item{graph}{The input graph, might be undirected or directed.}
24 edge directions. This argument is ignored for undirected graphs.}
|
| H A D | make_line_graph.Rd | 14 \item{graph}{The input graph, it can be directed or undirected.}
25 The line graph \code{L(G)} of a \code{G} undirected graph is defined as
|
| /dports/devel/tcllib/tcllib-1.20/modules/struct/graph/tests/ops/ |
| H A D | kcenter.test | 93 set result [lsort -dict [undirected [$solution arcs]]]
103 set result [lsort -dict [undirected [$solution arcs]]]
114 set result [lsort -dict [undirected [$solution arcs]]]
126 set result [lsort -dict [undirected [$solution arcs]]]
137 set result [lsort -dict [undirected [$solution arcs]]]
|
| H A D | eccentricity.test | 47 …}-s${setimpl}-st${stkimpl}-q${queimpl}-eccentricity-4.$n "eccentricity, $setup/$node, undirected" {
49 set result [struct::graph::op::eccentricity mygraph $node -arcmode undirected]
|
| /dports/devel/tcllibc/tcllib-1.20/modules/struct/graph/tests/ops/ |
| H A D | kcenter.test | 93 set result [lsort -dict [undirected [$solution arcs]]]
103 set result [lsort -dict [undirected [$solution arcs]]]
114 set result [lsort -dict [undirected [$solution arcs]]]
126 set result [lsort -dict [undirected [$solution arcs]]]
137 set result [lsort -dict [undirected [$solution arcs]]]
|
| H A D | eccentricity.test | 47 …}-s${setimpl}-st${stkimpl}-q${queimpl}-eccentricity-4.$n "eccentricity, $setup/$node, undirected" {
49 set result [struct::graph::op::eccentricity mygraph $node -arcmode undirected]
|
| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/man/ |
| H A D | delete_edge.Rd | 60 # Create an undirected graph with
71 # don't matter for the undirected case
78 # The undirected graph has a single
|
| H A D | from_adj_matrix.Rd | 9 mode = "undirected",
21 Options include: \code{undirected}, \code{directed}, \code{upper}, \code{lower}, \code{max}, \code{…
|
| /dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/graph/community/ |
| H A D | louvain.tex | 10 \title{Louvain algorithm for undirected and directed graphs}
76 Note that we assume the original graph to be simple and undirected.
201 \item Construct an undirected graph first, and then use the undirected case.
208 \subsection{Construction of an undirected graph}
210 an undirected graph with edge weights
215 and simply use the undirected algorithm.
217 an undirected graph, i.e. to use a directed graph with edge weights
224 We can follow this through the results for the undirected graph by
311 \item How an undirected graph could be constructed from a directed
312 graph, thereby allowing the undirected algorithm to be used for
[all …]
|
| /dports/sysutils/istio/istio-1.6.7/vendor/github.com/openshift/api/vendor/gonum.org/v1/gonum/graph/community/ |
| H A D | louvain.tex | 10 \title{Louvain algorithm for undirected and directed graphs}
76 Note that we assume the original graph to be simple and undirected.
201 \item Construct an undirected graph first, and then use the undirected case.
208 \subsection{Construction of an undirected graph}
210 an undirected graph with edge weights
215 and simply use the undirected algorithm.
217 an undirected graph, i.e. to use a directed graph with edge weights
224 We can follow this through the results for the undirected graph by
311 \item How an undirected graph could be constructed from a directed
312 graph, thereby allowing the undirected algorithm to be used for
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/doc/ |
| H A D | read_graphviz.rst | 42 The DOT language can specify both directed and undirected graphs, and
44 ``read_graphviz`` an undirected graph when reading an undirected graph;
120 The ``directed_graph_error`` exception occurs when an undirected graph
127 graph is undirected, as indicated by the ``graph`` keyword in the DOT
|
| /dports/math/p5-Graph/Graph-0.9725/t/ |
| H A D | 06_new.t | 11 [undirected => 0, [], [qw(directed)]],
12 [directed => 1, [], [qw(undirected)]],
|