There are several applications in VLSI technology that require high-speed shortest-path computations. The shortest path is a path between two nodes (or points) in a graph such that the sum of the weights of its constituent edges is minimum. Floyd-Warshall algorithm provides fastest computation of shortest path between all pair of nodes present in the graph… (More)

@inproceedings{Awasthi2013VerilogIO,
title={Verilog Implementation of a System for Finding Shortest Path by Using Floyd-Warshall Algorithm},
author={Sachin Awasthi and Vijayshri Chaurasia and Ajay Somkuwar},
year={2013}
}