###############################################################################
Read Me
By: Matt Owens
7/16/2012
###############################################################################
The Program:
The objective of this program is to model a network where the structure of the 
network can be changed.
###############################################################################
The files:
###############################################################################
MAIN
main.py:
How to run main.py
###############################################################################
MODULES
constraintManagersModule.py:

cplexSimModule.py:

demandDataModule.py:

importDataModule.py:

topoEditModule.py:
###############################################################################
INPUT FILES:
Demands.txt:
This text file is a list of the demands. The numbers from left to right are the
Demands location, Demand, Duration, and Start.
	
	Demand location:
	This is the path the demand is sent over.

	Demand:	
	This is the amount the demand is for.

	Duration:
	This is how long the demand lasts

	Start:
	This is the time when the demand starts.

pathsInfo.txt:
This is the file that is passed to main.py to determine the source and the sink
of the paths. The numbers from left to right are source, sink, and number of
paths. 
       Source:
       This is the beginning node in the path.
       
       Sink:
       This is the ending node in the path.

       Number of Paths:
       This is the number of paths that are geneated bye the program.
       
"graphfile".txt:
These file will have different names, but they are the description of the 
network. The first number is the number of links in the network. "number"-
"number" represents the links. The next number is the cost of the link. 

###############################################################################
OUTPUT FILES
kshortestpaths.txt:
This is the file generated by IanProg. It is a list of the shortest paths.

kerrors.txt:
If IansProg cannot generate all the paths you ask for, kerrors.txt gets how 
many it can produce.

"output".*:
###############################################################################
SHORTEST PATHS
IanProg:

shortestpath.cpp:

node.cpp:

node.h: