A new simple algorithm for enumerating all minimal paths and cuts of a graph

Abstract There are many algorithms to enumerate MPS and MCS. All of these involve advanced mathematics. This paper presents a new simple algorithm to determine all minimal paths between specified single terminal pair of arbitrary graphs or to determine all minimal cuts when the graph is planar. The algorithm is based on elementary concept of graph theory and dual principle. This algorithm is fast and simple. An example illustrates the algorithm.