initial try with benchmarking boilerplate code
implement cost edge array
string styling
move common edge-weight code out to a function
rename main file
minor changes to names and identifiers
no deprecated errors
add leda2boost transformer
fix transformer and add some tests for it
add kruskal_mst boost benchmarking
comments
first try at my_kruskal. It still just prints the weights
add "return"s. IDK if this is good practice
continuing with the kruskal implementation

- Added Lists for every edge and mapper for easy access and
  modifications
- correctly initialized lists and queues
- some changes in comments
- changes in the arguments of the function
finish implementation. it is *very* slow
make it a little bit faster by only adding on the end
switch to deques
Split to diff files, cache the graph's size to a var
add types.h makefile dependency
add image and fancy info to readme