final source file

Name : Rutayan Patro 
Compiler Used : g++ 
Compiler Version : g++ (Ubuntu/Linaro 4.6.4-1ubuntu1~12.04) 4.6.4 
Compile Instruction : g++ -O3 -o dijkstra dijkstra.cpp
Execution command:
  			./dijkstra –r n d x
    			./dijkstra –s filename
 			./dijkstra –f filename
Note:	-r: for random
	-s: for array based implementation
	-f: for fibonacci heap based implementation
	 n: # of nodes in the graph
	 d: edge density 
	 x: source point for dijkstra’s algorithm
	 filename: this file connects the details about the graph. Used when you don’t want to run in random mode. 
	 file format:	x //source point
			n e //#of nodes and #of edges
			p1 p2 “edge cost”
			p2 pm “ edge cost”
			.
			e lines representing edges between two points

In the random mode it will create a random graph with n nodes and d density and maintains an adjacency list for the graph connectivity. 

For -s and -f mode you need to input a file with the above explained format.