File: cs_nsep.m

package info (click to toggle)
suitesparse 1%3A5.12.0%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 176,720 kB
  • sloc: ansic: 1,193,914; cpp: 31,704; makefile: 6,638; fortran: 1,927; java: 1,826; csh: 765; ruby: 725; sh: 529; python: 333; perl: 225; sed: 164; awk: 35
file content (17 lines) | stat: -rw-r--r-- 646 bytes parent folder | download | duplicates (10)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
function [s,a,b] = cs_nsep (A)
%CS_NSEP find a node separator of a symmetric matrix A.
%   [s,a,b] = cs_nsep(A) finds a node separator s that splits the graph of A
%   into two parts a and b of roughly equal size.  If A is unsymmetric, use
%   cs_nsep(A|A').  The permutation p = [a b s] is a one-level dissection of A.
%
%   Example:
%       A = delsq (numgrid ('L', 10)) ;    % smaller version as used in 'bench'
%       [s a b] = cs_nsep (A) ; p = [a b s] ;
%       cspy (A (p,p)) ;
%
%   See also CS_SEP, CS_ESEP, CS_ND.

% Copyright 2006-2012, Timothy A. Davis, http://www.suitesparse.com

[a b] = cs_esep (A) ;
[s a b] = cs_sep (A, a, b) ;