Python code for transitive closure of a directed graph
-
Updated
Jan 6, 2021 - Python
Python code for transitive closure of a directed graph
Parse TSPLIB-formatted SOP input files and analyze the precedence constraints therein
ACM ICPC World Finals 2003 - Graph theory
Interpretive Structural Modelling (ISM). Returns a minimum-edge hierarchical digraph following J.N. Warfield's graph partitioning algorithm.
🕸️ Little helper for handling entity clusters
Notebooks for work related to medical ontologies
TC Optimizing Compiler
Faster partially dynamic transitive closure algorithms using predictions!
Transitive maven dependencies with Bazel.
Python implementation of Tarjan's strongly connected components algorithm.
Add a description, image, and links to the transitive-closure topic page so that developers can more easily learn about it.
To associate your repository with the transitive-closure topic, visit your repo's landing page and select "manage topics."