Creating an IP Network Topology Graph

Program fulfills all requirements:

8 Points:  The program runs Dijkstra's Algorithm (also called the Greedy Algorithm) properly, calculating and storing all the best paths from a city entered by the user using appropriate data structures.

4 Points:  The program prints the full paths and the total distance for all paths from user's city, 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.

4 Points: Your program contains a well designed class that encapsulates and stores the graph. The program uses appropriately designed other classes 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.

Coding Style: 

1 Point: The code is written in a professionally acceptable C++ style, including proper capitalization and good indentation.  The program is well commented according to accepted professional standards.

                                                   Interactive Grade (26 points total) _______________
 

                                                                                            Final Grade _______________

Csc 220 Data Structures , Fall 2006

Scott Badman   Office: B132   Phone: 353-2250   sbadman@parkland.edu

Parkland College, 2400 W. Bradley Avenue, Champaign, IL 61821