(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.