8000 GitHub - tanjary21/APSP_GPU: GPU implementation of Floyd-Warshall and R-Kleene algorithms to solve the All-Pairs-Shortest-Paths(APSP) problem on Graphs. Code includes random graph generators and benchmarking/plotting scripts.
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content
/ APSP_GPU Public

GPU implementation of Floyd-Warshall and R-Kleene algorithms to solve the All-Pairs-Shortest-Paths(APSP) problem on Graphs. Code includes random graph generators and benchmarking/plotting scripts.

5 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

tanjary21/APSP_GPU

BranchesTags

Repository files navigation

APSP_GPU

GPU implementation of Floyd-Warshall and R-Kleene algorithms to solve the All-Pairs-Shortest-Paths(APSP) problem on Graphs.

Code includes random graph generators and benchmarking/plotting scripts.

The heart of GPU utilization for solving APSP problems is the 'min-plus' opertaion, best described by the gif below:

About

GPU implementation of Floyd-Warshall and R-Kleene algorithms to solve the All-Pairs-Shortest-Paths(APSP) problem on Graphs. Code includes random graph generators and benchmarking/plotting scripts.

Topics

gpu cuda pytorch apsp graph-optimization network-optimization floyd-warshall-algorithm

Resources

Readme
Activity

Stars

5 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages
0