This project presents a Python implementation of the Floyd-Warshall algorithm using recursion. The algorithm computes the shortest paths in a directed graph, handling both positive and negative edge weights effectively, as long as there are no negative cycles.
- Clone this repository
- Change to root directory
cd floyd-warshall- Install necessary dependencies
pip install -r requirements.txtRun unit tests:
python -m _tests_.unitRun performance tests:
python -m _tests_.performanceRunning recursive function
To run the recursive function module, use the following command:
python -m functions.recursive(Note: Running this command will not produce any output as the function does not inherently print anything, you need to modify the script as necessary.)
Pull requests are welcome. Please make sure to update tests as appropriate.