1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
|
function [p,r] = cs_scc (A) %#ok
%CS_SCC strongly-connected components of a square sparse matrix.
% [p,r] = cs_scc(A) finds a permutation p so that A(p,p) is permuted into
% block upper triangular form. The diagonal of A is ignored. The kth block
% is given by A (s,s) where s = r(k):r(k+1)-1. A must be square.
% For bipartite or rectangular graphs, use cs_scc2.
%
% Example:
% Prob = ssget ('HB/arc130') ; A = Prob.A ; [p r] = cs_scc (A) ;
% cspy (A (p,p)) ;
%
% See also CS_DMPERM, DMPERM, CS_SCC2.
% CXSparse, Copyright (c) 2006-2022, Timothy A. Davis. All Rights Reserved.
% SPDX-License-Identifier: LGPL-2.1+
error ('cs_scc mexFunction not found') ;
|
