Implementation of the Edmonds graph algoritm for generating MST in directed graphs.
This implementation was based on an existing haskell implementation, I just rewrote it in C++ while still keeping the same structure and logic.
If it's the first time running the program, do a make setup. After that, just do make run.
The graph to run should be specified in a separated file (assigned to a constant in main.cpp).
Vertices will always start from 0 and the file should have the following format:
# comments are allowed
<n_vertices> <n_edges> <root> # first line
<edge_src> <edge_dest> <edge_weight> # subsequent lines