apsp
There are 12 repositories under apsp topic.
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.
aycandv/multi-facility-location-problem
Term Project of COMP 305 Course at Koç University
Liu-xiandong/FastAPSP
The Fast APSP algorithm is used to solve the All-Pairs Shortest Paths (APSP) problem. The algorithm uses the divide and conquers strategy. First, divide the graph structure by METIS, and divide the input graph G into multiple subgraphs. Then the solution of the APSP problem is solved by computing the subgraph. The Fast APSP algorithm combines the SSSP algorithm and the Floyd-Warshall algorithm. Compared with the Part APSP algorithm, it eliminates the data dependence and communication between sub-graphs. The Fast APSP algorithm has achieved good performance in graphs with good properties. We tested a lot of sparse graph data in the Suite sparse matrix collection and network repository, and the Fast APSP algorithm showed better performance than other APSP algorithms.
stoianmihail/FasterTSP
Proof of concept for "TSP Escapes the O(2^n n^2) Curse" -- First improvement after more than 60 years
felipelouza/apsp
An improved algorithm for the all-pairs suffix-prefix problem [JDA 2016]
felipelouza/p-apsp
Parallel computation for the all-pairs suffix-prefix problem [SPIRE'16]
Ocramnaig94/parallel-all-pairs-shortest-path
A cost-optimal parallel algorithm based on Floyd-Warshall Algorithm in order to resolve the APSP problem
iodim/pds_2015
Projects for the Parallel & Distributed Systems course of 2015
Abdallah-Elshamy/floyd-warshall
An implementation for the floyd-warshall Algorithm to solve All-Pairs Shortest Paths problem
AbdeltwabMF/competitive-programming-3
My Solutions to problems in [Competitive Programming 3]