The Graph Project

This page contains links to the files related to the Graph Project algorithm. Here are the following files provided:

1. The executable file runs a demo of the program.
Instructions for running the program:

- Choose the two input files by clicking the “Browse...” button, then click “Start”.
- The three graphical interfaces showing up represent the initial graph and the segment trees associated with the two input spanning trees.
- On the main graph window, choose between the “Manual Advance”, “Automatic Advance” and :Very Fast Advance” of the algorithm. The “Manual” option requires clicking the button at each step. “Auto Advance” sets each step to follow automatically at an interval of two seconds. The “Very Fast” option allows a rapid execution for quickly seeing the results.
- The program will prompt a message box indicating that the algorithm is over when this will be the case, displaying the number of the remaining edges, if any – the edges remaining will be the ones still visible on the graph.

2. The two sample input files represent the entry black spanning tree and red spanning tree that make up the graph.  
When providing the input files, please keep in mind:

- The regular style is one edge per line, in the format “node1-node2”;.
- The algorithm parses the file and removes additional spaces and return characters.
- The two files need to have exactly one edge in common, the start edge, otherwise the algorithm won’t run

3. The JAR file can be imported into an external Java project. Please refer to the associated readme file for instructions on how to be used.