https://github.com/giovaneiwamoto/cuda-shortest-paths
🧩 Cuda Shortest Paths - Parallel Dijkstra and Floyd algorithms using Nvidia CUDA to calculate All-Pairs Shortest Path (APSP) in a given graph represented by its adjacency matrix.
https://github.com/giovaneiwamoto/cuda-shortest-paths
all-pairs-shortest-path cuda nvidia
Last synced: 5 months ago
JSON representation
🧩 Cuda Shortest Paths - Parallel Dijkstra and Floyd algorithms using Nvidia CUDA to calculate All-Pairs Shortest Path (APSP) in a given graph represented by its adjacency matrix.
- Host: GitHub
- URL: https://github.com/giovaneiwamoto/cuda-shortest-paths
- Owner: GiovaneIwamoto
- License: mit
- Created: 2023-11-10T04:07:06.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-07-30T04:15:35.000Z (about 1 year ago)
- Last Synced: 2025-04-05T14:41:58.232Z (6 months ago)
- Topics: all-pairs-shortest-path, cuda, nvidia
- Language: Cuda
- Homepage:
- Size: 350 KB
- Stars: 6
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE