most of the parent/child relations have been removed and replaced with
the adjacencylist for the spanning tree...the export file still needs
updated and a few others
battling the following:
multiple definition of main_savitch_8B::queue functions
in the cluster, helper, and spanning tree objects

Hopefully after this things will be complete for the move to using the
adjacencyList from the linkedlist class I implemented instead of
parent/child relations. I also started the local opt by implementing the
different types of bfs we need.

Next steps after getting this working is to update the way we store the
clusters.
Finally! The adjacency list is fully functional and the code is running.
The next stage will be to redo the clustering. The current running times
for construting just a single solution (ie spanning tree) are about 0.1s
and 4s for the 100v and 1000v graph instances respectively. Hopefully
the new clustering method will help. It will for sure help with when we
construct many iterative solutions due to the current clustering needing
separate objects for each cluster which for each solution will need to
be created and destroyed which would be very time consuming.

The BFSs are also implemented, however the local opt stages are not. So
after the new clustering gets implemented the local opt stages are next
and will hopefully not take too long since part of them are done in that
the BFSs are coded for the needed functionality.