Python code for transitive closure of a directed graph
-
Updated
Jan 6, 2021 - Python
Python code for transitive closure of a directed graph
🕸️ Little helper for handling entity clusters
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."