ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Mon, 28 Jul 2014 15:15:00 +0200How to use Sage to find a pair of vertex-disjoint paths of minimal total length?https://ask.sagemath.org/question/23609/how-to-use-sage-to-find-a-pair-of-vertex-disjoint-paths-of-minimal-total-length/I want to find a pair of vertex-disjoint (s,t)-paths with minimal total length in a graph G, where the length is the sum of the edge weights of the paths. For this I would like to use the [Suurballe and Tarjan Algorithm](http://en.wikipedia.org/wiki/Suurballe%27s_algorithm"), but it seems to be a hidden (if I am right?) method. Is there any way I can still use this algorithm other than reprogram it myself?BartMon, 28 Jul 2014 15:15:00 +0200https://ask.sagemath.org/question/23609/