About the project

The goal of this project is to implement an algorithm for finding
the shortest pair of disjoint paths between two nodes in a directed graph

The algorithm is based on the article:
A quick method for finding shortest pairs of disjoint paths, J. W. Suurballe, R. E. Tarjan, June 1984

Input file format

The format of input file describing a directed graph is as follow:

n 
a b w 
d h w

where
n - the number of nodes
a,b,d,h - the node id (a number between 0 and (n-1))
w - the weight of an edge connecting two nodes

A valid example of such a file is

./dataset/parsing/example1

Files ./dataset/parsing/example2 & ./dataset/parsing/example3 are examples of invalid input.

How to run it

TBD