CMP101 Grading Guide - program 3	Total points:  100  (+10 bonus)

60 points for program correctness:

__________     5 points for makefile/README/Drivers

__________     5 points for warning-free compilation of main with all ADTs

__________    15 points for reading and echoing the graph with edge costs

__________    20 points for correctly performing Dijkstra's and
	      outputting the first path.

----------     5 points for printing transit times for paths

__________    10 points continuing to output correct paths
	      on other requests


40 points for Style/ADTs

__________    10 points for graph module implementing adjacency lists

__________     5 points for good module description/interfaces in header files

__________     5 points for information hiding (only handle type exported)

__________     5 points for dynamic memory management 
			(malloc's/free's rather than arrays/MAXSIZE constants)

__________     5 points for functions: commented, appropriate size, 
		no redundant code

__________     5 points for good variable, type, and function names


__________     5 points for readability and consistency and adherence 
		to style guidelines


__________     Bonus points (max 8):
		+5 pts for finding the most central neighborhood to
		   for the firestation.
		+3 pts reader discretionary for exceptionally good 
		   programs.

__________	Penalty:
		up to -10 points (reader discretion) additional penalty for 
                 extremely poor: indentation, missing curly brackets, 
                 undocumented trickyness, inconsistent capitalization,
		 infinite loops, and/or other problems causing readability 
	 	 or grading difficulties.  This includes putting the 
                 whole program in one file.

___________	TOTAL