COSC5313                       Program-3              Due: 4/6/2011

                                   Minimum Total Load

        Consider the following Flow Network:

               (1,2,10)

               (1,3,20)

               (1,4,12)

               (2,5,14)

               (3,5,10)

               (4,3,6)

               (4,6,16)

               (4,7,14)

               (5,6,11)

               (5,7,12)

               (6,7,15)

               Note that each triple represents a weighted edge such that

               the first number is the originating node, the second

               the terminating node and the third its weight.

        Task:

        Write a well-structured program that does the following:

1.    Find and print all topological orderings of nodes of the input Flow Network.

2.    Find and print out an Optimal topological ordering.

3.    Compute a Maximum Restrictive Cutset (which represents Minimum Total Load) 

and print out all its nodes.

4.    And, print out the value of the Minimum Total Load itself.

        Requirement:

        1. For the efficiency purpose, your program must use only one optimal 

           topological ordering in finding the Maximum Restrictive Cutset.

        2. If unable to use only one topological ordering, your program

           must indicate so in the BEGINNING comments.