Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Wrong shortest path matrix returned when using Floyd-Warshal GPU algorithm on Large Graph (N>=3300) #19

Closed
wariobrega opened this issue Feb 22, 2019 · 1 comment
Assignees
Labels
bug Something isn't working

Comments

@wariobrega
Copy link
Contributor

When using the shortest_path_gpu method on a large graph (with more than 3000 nodes) the shortest path matrix is either returned incorrect (on Linux machines) or it raises a CUDA_UNKOWN_ERROR on a Windows based machine.

Setups:

Linux machine:

  • Graphic device: NVIDIA GeForce GTX 1050 Ti
  • Cuda version= 10.0

Windows:

  • NVIDIA Quadro
  • Cuda version = 8.0
@wariobrega wariobrega added the bug Something isn't working label Feb 22, 2019
@mazzalab
Copy link
Owner

mazzalab commented Mar 29, 2019

Issue solved with new implementation of shortest path gpu in commit ec0734d

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
bug Something isn't working
Projects
None yet
Development

No branches or pull requests

2 participants