This repo holds shared code for Program 04 in CSC210, Spring 2020.
There are two interfaces that define our undirected graphs: Graph210 and Edge210.
The GraphHelper class suggests a couple of static methods you might entertain.
thanks...yow, bill
Graph files and results are located in the graphs folder.
My starter graphs are files test0.txt, test1.txt, test2.txt, and test3.txt. The number indicates the number of vertices in the graph. Use these tiny graphs to test your new code.
I have copied some of Sedgewick's example graphs from https://algs4.cs.princeton.edu/43mst/.
- tinyEWG.txt - the 8 vertex example Sedgewick shows in his book
- mediumEWG.txt - Sedgewick's 250 vertex example
- 1000EWG.txt - Sedgewick's 1,000 vertex example
- 10000EWG.txt - Sedgewick's 10,000 vertex example
I did not copy Sedgewick's BIG daddy (largeEWG.txt) which "contains one million vertices and 7,586,063 edges". I leave that one to you. (ha)
My Prim's solutions are:
- tinyEWG_prims_mst.txt - my Prim's solution to Sedgewick's tinyEWG graph
- tinyEWG_sedgewick_prims_mst.txt - this is Sedgewick's Prims's solution to tinyEWG
- medium_prims_mst.txt - my Prim's solution to Sedgewick's medium graph
- 1000EWG_prims_mst.txt - my Prim's solution to Sedgewick's 1,000 vert graph
- 10000EWG_prims_mst.txt - my Prim's solution tp Sedgewick's 10,000 vert graph
- V0.2 released on Wed Apr 15
- V0.1 released on Mon Apr 6