📄 cutsize.m
字号:
function [ne,edges] = cutsize(A,map);% CUTSIZE : Edges cut by a vertex partition.%% ne = cutsize(A,part) : part is a list of vertices of A;% ne is the number of edges crossing the cut.% [ne,edges] = cutsize(A,part): Same, edges is the crossing edges as rows [i j].%% "part" may also be a map, with one entry per vertex.%% John Gilbert, 1993.% Copyright (c) 1990-1996 by Xerox Corporation. All rights reserved.% HELP COPYRIGHT for complete copyright and licensing notice.% Take input in either order unless A is 1 by 1.if size(map,1) == size(map,2) & size(map,1) > 1 t = A; A = map; map = t;end;% Convert input to a map in any case.if length(map) ~= length(A) | max(map) == length(A) [ignore,map] = other(map,A);end;[i,j] = find(A);f = find(map(i) > map(j));ne = length(f);edges = [i(f) j(f)];
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -