This project is an academical project which aims to compute minimum spanning tree algorithm on Paris trees from a csv database.
One year after, I come back on the database to try to enhance coding quality and review my past mistakes.
- CLI parsing, use vrgcli, it seems easier
- gui library : use sdl2 instead, more universal and portable
taking a first look at the basecode shows there are plenty of modifications to be done !
A test framework needs to be used, why not this one let's write some unit tests