Hi, it seems that nvgraphSssp() only provides the shortest path distance, not the path itself. How can I get the predecessors of vertices in the shortest path obtained in nvgraphSssp()?
Related topics
Topic | Replies | Views | Activity | |
---|---|---|---|---|
nvgraph details or source code | 0 | 519 | April 20, 2018 | |
Does nvGraph still exist? | 1 | 399 | February 4, 2024 | |
example for nvgraph with matrix market format | 3 | 1405 | February 27, 2017 | |
simple CUDA implementation of the Floyd-Warshall graph algorithm | 13 | 14976 | March 12, 2015 | |
Corrupt nvshmem online doc link | 2 | 22 | June 30, 2025 | |
Isaac sim 4.2.0 NavMesh has no attribute 'query_navmesh_path' | 6 | 217 | October 26, 2024 | |
The best and most recent cuda BFS graph traversal implementation | 1 | 527 | March 29, 2024 | |
Ask Me Anything: Experts Answer Your NVIDIA cuGraph Questions Live | 0 | 347 | April 6, 2023 | |
NetworkX Introduces Zero Code Change Acceleration Using NVIDIA cuGraph | 1 | 19 | October 22, 2024 | |
NetworkX, NVIDIA cuGraph를 사용한 제로 코드 변경 가속화 도입 | 1 | 13 | October 25, 2024 |