Enumeration of minimal cutsets from matrix representation of directed/undirected networks

Abstract This paper describes an algorithm for finding the minimal cutsets between a specified source and terminal nodes of directed/undirected networks. Adjacent nodes of a source node/merged node are determined by the collection of node numbers of columns corresponding to non-zero elements of the first row of the adjacency matrix to form the reduced adjacency matrix (RAM) corresponding to merged nodes. Connectivity of RAM has been checked to obtain the minimal cutsets.