This repo is to solve the all-pairs shortest path problem with CPU threads and then further accelerate the program with CUDA accompanied by Blocked Floyd-Warshall algorithm
-
Updated
Jan 25, 2022 - Cuda
This repo is to solve the all-pairs shortest path problem with CPU threads and then further accelerate the program with CUDA accompanied by Blocked Floyd-Warshall algorithm
🧩 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.
Add a description, image, and links to the all-pairs-shortest-path topic page so that developers can more easily learn about it.
To associate your repository with the all-pairs-shortest-path topic, visit your repo's landing page and select "manage topics."