Difference between revisions of "Scomponents.m"
| Line 1: | Line 1: | ||
| − | + | {{DISPLAYTITLE:function.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) | |
| − | |||
| − | + | ==Arguments== | |
| + | |||
| + | 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]] | ||
| + | |||
| + | |||
| + | ''Version 2.3, authors: [[Ilya Kuprov]]'' | ||
Revision as of 17:10, 28 December 2018
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)
Arguments
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
Version 2.3, authors: Ilya Kuprov
