GitHub

CUDA implementation of the Floyd-Warshall All pairs shortest path graph algorithm(with path reconstruction)

UPDATE: Made a new table with times for Tesla GPU. Make sure you run in release mode for full speed! This is a very simple implementation of the Floyd-Warshall all-pairs-shortest-path algorithm ...
GitHub

Floyd-Warshall algorithm

The Floyd-Warshall algorithm is a common method for finding the shortest paths between all pairs of vertices in a graph. It has a time complexity of O(∣V∣3)O(∣V∣3), where ∣V∣∣V∣ is the number of ...
IEEE

Retiming technique for clock period minimization using shortest path algorithm

Abstract: VLSI technology requires three main factors high speed, less power and small chip area. Speed is the factor which always depends upon clock frequency. Computation time of digital circuit can ...