Difference between revisions of "Scomponents.m"
(Update function See also links and function index membership) |
|||
| (5 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | + | {{DISPLAYTITLE:scomponents.m}} __NOTOC__ | |
| − | + | Strongly connected components of a graph, David Gleich's implementation of Tarjan's algorithm (http://dx.doi.org/10.1137/0201010). | |
| − | |||
| − | + | ==Syntax== | |
| − | + | sci=scomponents(A) | |
| − | |||
| − | + | ==Parameters== | |
| + | |||
| + | A - a logical square matrix with 1 for the | ||
| + | connected nodes in the graph | ||
| + | |||
| + | ==Outputs== | ||
| + | |||
| + | sci - a column vector with integers that spe- | ||
| + | cify the strongly conected component | ||
| + | that each node of the graph belongs to | ||
| + | |||
| + | ==See also== | ||
| + | [[sparse2csr.m]], [[zte.m]], [[path_trace.m]], [[reduce.m]], [[dfpt.m]], [[adelim.m]], [[coherence.m]], [[correlation.m]], [[homospoil.m]], [[human2opspec.m]], [[lin2lm.m]], [[lin2lmn.m]], [[lm2lin.m]], [[lmn2lin.m]], [[sinkhole.m]], [[sphten2zeeman.m]], [[stitch.m]], [[Kernel_utilities]] | ||
| + | |||
| + | ''Version 2.3, authors: [[Ilya Kuprov]]'' | ||
Latest revision as of 19:41, 6 June 2026
Strongly connected components of a graph, David Gleich's implementation of Tarjan's algorithm (http://dx.doi.org/10.1137/0201010).
Syntax
sci=scomponents(A)
Parameters
A - a logical square matrix with 1 for the
connected nodes in the graph
Outputs
sci - a column vector with integers that spe-
cify the strongly conected component
that each node of the graph belongs to
See also
sparse2csr.m, zte.m, path_trace.m, reduce.m, dfpt.m, adelim.m, coherence.m, correlation.m, homospoil.m, human2opspec.m, lin2lm.m, lin2lmn.m, lm2lin.m, lmn2lin.m, sinkhole.m, sphten2zeeman.m, stitch.m, Kernel_utilities
Version 2.3, authors: Ilya Kuprov
