VisualGraph

★ 8 Open GitHub ↗

A demo of Floyd–Warshall algorithm for finding shortest paths in a weighted graph

Explore Similar Repositories

DunMaoSSSP : A ~mvp~ Rust implementation of the DunMao et al breakthrough? deterministic algorithm for Single-Source Shortest Paths (SSSP) that breaks the O(m + n log n) sorting barrier on directed graphs. Based on the 2025 paper by Duan, Mao and collaborators from Tsinghua University.
cspy : A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
dachshund : Dachshund is a graph mining library written in Rust. It provides high performance data structures for multiple kinds of graphs, from simple undirected graphs to typed hypergraphs. Dachshund also provides algorithms for common tasks for graph mining and analysis, ranging from shortest paths to graph spectral analysis.
GAL-DAWN : GAL-DAWN: An Novel High performance computing Library of Graph Algorithms based on DAWN, CUDA/C++
PESGraph : Objective-C implementation of a Graph, along with Dijkstra's algorithm for shortest path finding
// repository documentation