Abstract
The project deals with implementation of Floyd Warshall Algorithm i.e All Pair Shortest Path. This algorithm is implemented using parallel programming concept for faster solution. This is a research based project in which the serial and parallel computations are compared.Floyd Warshall algorithm has overcome the drawbacks of Dijkstra’s and Bellman Ford Algorithm. For parallel programming, the project is implemented using NVIDIA GPU(NVIDIA GeForce 820M , 410M) for which CUDA(CUDA Toolkit 6.0) is used . The purpose of developing this project is to find the shortest path between all the present nodes in a graph.This system is designed to work on a large dataset(set of 48 or 72 or 100 cities).This project can be implemented for Airline Systems,Transportation services, Courier Services, Networking.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
