Improved bhandari / suurbale algorithm

[afourmy]

Right now, I use bhandari / suurbale to find the shortest link-disjoint pair. The following improvements can be implemented:

• find the K edge-disjoint paths, K > 2.
• instead of edge-disjoint paths, find the node-and-edge-disjoint paths (which ensures the recovery path is available in case of node failure too)
• when no path is available, find the K maximally edge-disjoint paths (i.e the paths with the least number of edges in common)