Project 4 Grade Report for _________
Project 4

Creating a Network Routing Table 

Program compiles and runs:

1 Point:  Compiles without errors and runs without deadlocks or crashes, as a Visual C++ default workspace. 

Program fulfills all requirements:

5 Points:  The program reads the file ROUTING.DAT and constructs a complete graph data structure in memory using an appropriate data structure in its own class.

6 Points:  The program runs Dijkstra's Algorithm (also called the Greedy Algorithm) properly, calculating and storing all the best paths from CHAMPAIGN using appropriate data structures in well designed classes.

3 Points:  The program prints the full paths and the total distance for all paths from CHAMPAIGN, both to the screen and to Results.txt

Good Object Oriented Design:

1 Point:  The program has a reasonably small, logically simple void main() that then creates and uses appropriate, well designed classes to do the work.

2 Points: The program uses appropriately designed objects that present a logical and useful public interface and consistently maintain their encapsulated data.  Each class has a single, clearly understandable purpose.  The class structure reflects the natural logic of the problem.  Specifically, your program must at least have separate classes that encapsulate the graph, that run Dijkstra's Algorithm, and store the best paths.   

Coding Style: 

2 Points: The program is stored in proper places on the disk.  The code is written in a professionally acceptable C++ style, including proper capitalization and good indentation.  The program is well commented as specified in class.

                                                   Interactive Grade (20 points total) _______________
 

                                                                                            Final Grade _______________
 
badman.jpg (2629 bytes) Office:  M233a Phone:  353-2250 sbadman@parkland.edu