Question: Suppose you had an algorithm that would find the maximum k for which two nodes in a graph are k-connected (e.g., the max-flow algorithm test illustrated in Fig.) How would you modify Kleitman's algorithm to find the maximum k for which the graph is k-connected? Apply your modified algorithm to the graph of Fig.
