Implements sorting algorithm for directed acyclic as well as cyclic graphs. The directed cyclic graphs are sorted by determining the minimal amount of cyclic edges and optionally then also determining the maximum amount of groupings possible with a minimal amount of cyclic edges.
Library for building Modular and Asynchronous Graphs with Directed and Acyclic edges (MAGDA)
Causal inference is the process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system. Here the project realized for the course at EPFL.
Add a description, image, and links to the acyclic-graphs topic page so that developers can more easily learn about it.
To associate your repository with the acyclic-graphs topic, visit your repo's landing page and select "manage topics."