https://github.com/nazanin1369/parallelshortestpath
Parallel implementation of a shortest path algorithm
https://github.com/nazanin1369/parallelshortestpath
Last synced: 8 months ago
JSON representation
Parallel implementation of a shortest path algorithm
- Host: GitHub
- URL: https://github.com/nazanin1369/parallelshortestpath
- Owner: Nazanin1369
- Created: 2014-02-26T07:43:34.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2015-09-01T00:13:17.000Z (about 10 years ago)
- Last Synced: 2025-01-07T20:49:43.636Z (9 months ago)
- Language: Java
- Homepage:
- Size: 148 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## ParallelShortestPath
Parallel implementation of a shortest path algorithm
### What is it about?
The Shortest Path Faster Algorithm (SPFA) is an improvement of the Bellman–Ford algorithm which computes single-source shortest paths in a weighted directed graph. The algorithm is believed to work well on random sparse graphs and is particularly suitable for graphs that contain negative-weight edges. However, the worst-case complexity of SPFA is the same as that of Bellman–Ford, so for graphs with nonnegative edge weights Dijkstra's algorithm is preferred.[2] The SPFA algorithm was published in 1994 by Fanding Duan.
### Why parallel?
Since I have to compute the shortest path trees with origins in all nodes, it is only natural to do it in parallel (as the trees are independent of each other).
### How??
I'm doing it with the use of a pool of workers using the multiprocessing and appending the results to a list
### How to run??
javac *.java
java Application