 Copyright(c) 2005 Saurabh Arun Samdani. All rights reserved.
 Indian Institute of Technology Guwahati 

/* cpm: Critical path method
	Program for critical path calculation
	The program calculates the critical path for an activity on edge networks (CPM).
	Topological sorting is used.
	Makefile is provided, type "make" at the  command line to compile the code.
	Executable "cpm " is produced.
	Code was written and tested on Linux machines but should have no problems on running elsewhere.

	To use the program use this syntax
	./cpm <inputfile>
	If inputfile is not prepared simply use
	./cpm
	the program asks for "
	output file name
	Number of activities 
	Number of events 
	and for each activity 
	Name, duration, preceding node (i) and succeding node (j)

	Activity Number of the start activity should be "1" if input is given from terminal or keyboard.

	Please note that in this case the program scans the data and writes it into the output file which is
	later used by the input(); function in "io.c"
	The convention used is  start event number is taken as '0' since C arrays are from 0 to n-1 
	Sample inputfile generated by the program (  see "aoe.inp" in the directory)
	Number of activities is 11 
	Number of events is 9 
	
	11 9
                  a3 5.000  0  3
                  a2 4.000  0  2
                  a1 6.000  0  1
                  a4 1.000  1  4
                  a5 1.000  2  4
                  a6 2.000  3  5
                  a8 7.000  4  7
                  a7 9.000  4  6
                  a9 4.000  5  7
                 a10 2.000  6  8
                 a11 4.000  7  8

	Other sample input file   is "dummy.inp"

If you have any comments please email :samdani@iitg.ernet.in 
					saurabh.samdani@gmail.com

*/


