This repository contains two projects written in Java.
This project takes an input file (one of the multiple txt files in the folder) and runs Dijkstra's Algorithm on it. It prints out the results in the console. To change the file change the filename String and change the number of vertices and edges. The numbers in the WarAndPeace files are the number of vertices and edges respectively. "graph24-6.txt" and "graph-lotr.txt" both contain 5 vertices and 10 edges.
This project takes an input file (one of the multiple txt files in the folder) and runs Prim's Algorithm on it. It prints out the results in the console. If testing a WarAndPeace file just change the numVertices and numEdges values to the ones in the name of the file. If using "graph24-6.txt" and "graph-lotr.txt" both contain 5 vertices and 10 edges. Since this program is running Prim's Algorithm it has to make the files which are directed graphs into undirected ones.