Dijkstra's Algorithm

This project builds a graph, then applies Dijkstra's Minimum Path algorithm.

The header files contain templated function definitions, as well as their declarations.

There are a variety of text files used for input, scratch work, and output.
The "input.txt" file is critical; it comprises an adjacency-matrix definition of the graph. Other files are included for completeness; none is very interesting.

The "mainD" function is a test driver.

The "debugnew" files came for free; I didn't develop these, but used them in the project.

This was the last of four projects in
CS 315 - Data Structures, Sonoma State University, Fall 2003
Taught by Dr. Richard Gordon

• debugnew.cpp
• debugnew.h
• dykstra.txt
• graphD.h
• graphioD.h
• input.txt
• mainD.cpp
• output.txt
• outputCopy.txt
• outputFrom.txt
• outputOrig.txt
• outputTo2.txt
• outputTo3.txt
• shortestpathD.h

--Back--