This initial version of the project is composed of one representation for directed graphs and the chu-liu-edmonds algorithm for finding the minimum spanning tree of a given digraph.
The chosen representation is an adaptation derived from a somewhat generic graph implementation provided by Kyle Loudon on his book Mastering Algorithms in C, which defines an adjacency list where each of its elements is structured as an origin vertex and a set of the vertices that the origin contains an edge to.
The algorithm for finding a directed MST is derived from Jack Edmonds' paper Optimum Branchings, along with a list of other sources, such as:
In order to build and compile the project, CMake must be installed. After setting it up, build the project as follows:
git clone https://github.com/gustavodiasag/graph-repr.git
cd graph-repr/
mkdir build
cd build
cmake ..
cmake --build .This project is licensed under the MIT License.