https://github.com/iamsocoodnjdsamjdfnsndaf/bmssp
🚀 Implement a near-optimal Bounded Multi-Source Shortest Path algorithm in Go, optimizing performance for large graphs beyond traditional methods.
https://github.com/iamsocoodnjdsamjdfnsndaf/bmssp
benchmark benchmark-game bmssp bounded-multi-source-shortest-paths c crystal dijkstra-algorithm elixir erlang fastest-path graph graph-algorithms graphs graphs-theory kotlin nim search shortest-path-algorithm
Last synced: 3 months ago
JSON representation
🚀 Implement a near-optimal Bounded Multi-Source Shortest Path algorithm in Go, optimizing performance for large graphs beyond traditional methods.
- Host: GitHub
- URL: https://github.com/iamsocoodnjdsamjdfnsndaf/bmssp
- Owner: Iamsocoodnjdsamjdfnsndaf
- Created: 2025-08-20T18:23:50.000Z (4 months ago)
- Default Branch: main
- Last Pushed: 2025-08-20T23:19:55.000Z (4 months ago)
- Last Synced: 2025-08-21T01:17:57.976Z (4 months ago)
- Topics: benchmark, benchmark-game, bmssp, bounded-multi-source-shortest-paths, c, crystal, dijkstra-algorithm, elixir, erlang, fastest-path, graph, graph-algorithms, graphs, graphs-theory, kotlin, nim, search, shortest-path-algorithm
- Language: Go
- Size: 29.3 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0