Difference between revisions of "Scomponents.m"
(Normalise sequential blank lines) |
m (Rename Arguments section heading to Parameters) |
||
| Line 6: | Line 6: | ||
sci=scomponents(A) | sci=scomponents(A) | ||
| − | == | + | ==Parameters== |
A - a logical square matrix with 1 for the | A - a logical square matrix with 1 for the | ||
Revision as of 18:52, 5 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
Version 2.3, authors: Ilya Kuprov
