This will be an interface step between drawing the graph and viewing the minimal spanning tree or what ever. This code should hold every step of the graph process, such as which nodes have been looked at, and which are in the queue currently. will require a complete restructuring of this aspect of the program. starting with the way the algorithms process the information about what is happening at this stage. all of this information should be saved to the current stage in this process graph object that has been created for the graph that is being looked at.
This will be an interface step between drawing the graph and viewing the minimal spanning tree or what ever. This code should hold every step of the graph process, such as which nodes have been looked at, and which are in the queue currently. will require a complete restructuring of this aspect of the program. starting with the way the algorithms process the information about what is happening at this stage. all of this information should be saved to the current stage in this process graph object that has been created for the graph that is being looked at.