MCNF Formulation of Shortest Path Problems

• Origin Node s has a supply of 1

• Destination Node t has a demand of 1

• All other Nodes are Transshipment Nodes

• Each Arc has Capacity 1

• Tracing A Unit of Flow from s to t gives a Path from s to t

Previous slide

Next slide

Back to first slide

View graphic version