Dear Sir or Madam, There is a maple code below for finding all paths between two given pair of vertices. Is there any maple code available for finding all minimal cut sets ( i.e., components whose failure will results in a network failure) between any given pair of vertices? For example, a bridge network: >with(networks): >G:=graph({1,2,3,4},{{1,2},{1,3},{2,3},{2,4},{3,4}}): Question: Find all cuts between node 1 and node 4. Doing it by hand, I got: [{1,2},{1,3}],[{2,4},{3,4}],[{1,2},{2,3},{3,4}],[{1,3},{3,2},{2,4}]. It is not easy to enumerate all cut sets by hand when the network is large. How do I code it in Maple??