A simple program that finds the transitive closure of a graph using a modified version of the Floyd-Warshall Algorithm
-
Updated
Aug 11, 2024 - C++
A simple program that finds the transitive closure of a graph using a modified version of the Floyd-Warshall Algorithm
Faster partially dynamic transitive closure algorithms using predictions!
Floyd-Warshall transitive closure algorithm for weighted and directed graphs using a Boost implementation
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."