An Innovative Approach For Computation Of Data In Shortest Paths Project Source Code

An innovative approach for computation of data in shortest paths project Description:

An innovative approach for computation of data in shortest paths project is a 2008 project which is implemented in java platform. This project proposes a new method for finding shortest path between source and destination based on time which works on two methods called random discretization and path delay discretization. This method is alternate method for presently used Dijkstra’s algorithm which works on predefined weight.

In this process source node sends data to neighbor node which will check whether it is destination node else it will append its details and send it to its neighbor node and this process continues until it is reached to exact node. In this process we will calculate entire path and time delay between nodes and time taken by source to reach destination.

Here we provide entire project source code, database, and full documentation and procedure for executing this project.

download An innovative approach for computation of data in shortest paths project base paper pdf, source code in java, project report and ppt.