The Floyd-Warshall CSV Generator script is a simple wrapper of the SciPy floyd_warshall function, enabling the generation of shortest paths between all pairs of vertices in a graph.
It filters out duplicate paths, considers paths as undirected, and excludes paths with a cost higher than the specified max-weight.
The script aims to generate 'all edges' data for the World Locality Transit Graph and can be useful for directed or undirected weighted graphs.
Considered interesting uses beyond the World Locality Transit Graph, encouraging users to explore and experiment with the script for various applications.
Collection
[
|
...
]