Here is an algorithm to enumerate all minimal cut set. How can I put it in Maple?

/*input a connection matrix edge[n][n],
output the cutsets.*/
int n = IVI;
char edge[n][n], *cutset[];
for( int a=@ a<n; a++) {
cutset[ a]=??;
for( int i=a; i<n; i++) {
if( i==l) /*vertex i=l, adjacent to a=O*/
for( int j=O; j<n; j++) {
i=i+ 1 ;
if( cutset[i]~l==edge[illjl)
else
strcat(cutset[i] ,??);
strcat(cutset[i] ,edge[i] ti]);
I
strcat(cutset[i],?\null?);
cutset+=cutset[i];
/*printf(?cutset is %s\n ?,cutset[i]);*/
}
}

Yontha

This post was generated using the MaplePrimes File Manager

Download 4784_yon.txt
View file details