First, a graph generator is needed to form both dense and sparse graphs. Some graphs such as grids and cubes can be used as sparse graphs.
Then, comare the efficiency of 3 algorithms for all paris shortest paths. You must implement the standard dynamic programming algorithm, and two versions of dijkstra's algorithm running form all points. One version of Dijkstra's algorithm has time complexit of O(n^2), and the other use heap (piroity Q) has time complexity O(mlogn). Run these programs on different data sets. Try at least 30 different graphs, ranging from 30 to 500 vertices. Include both sparse and dense graphs. note that random graphs are not the source of data.
Finally, measure the cpu time and possibly the storage of different algorithms.
The program will be written in c++ and be able to run on unix/linux machine.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).