Monitoring Path Nearest Neighbor in Road Networks- 2009 ACM, Implementation of journal paper (1953630)

This project is related with the implementation of an computer science related journal paper. I can provide the journal paper upon request and my task is to basically develop the source code for that journal paper and then implement. The journal papers consists of nearly 5 algorithms( Pseudo code)and they are to be developed in suitable language, Once the original source code of each is developed, They should be then combined to work as one project and implement. Further, I want to make some changes across the original paper and hence, the original code and then compare the results of the original work with mine. This project is part of a master level thesis and could be implemented in any language (though i prefer to use Java as I have some experience in that). The time frame required is two months. The paper is based on graph theory and involves the use of dijkstra's algorithm in a bi-directional way and then follows on with some other algorithm. I need to compare basically the CPU time involved in running the complete algorithm in both original case and with the mine changes. Some improvement in the time span would lead to success in project and completion of my thesis. ## Deliverables This is the paper which is to be worked with. I have explained what i exactly want in the basic requirements. f you take a look at this paper and take a look you can see some Algorithms provided, such as Algorithm 1 &2 on page 595,3 and 4 on page 596 and 597 and Algorithm 5 and 6 on page 598 respectively. While all journal papers provide us with algorithms, they don't give the complete source code which could be any computer programming language say C/C++/Java . So Finally, to sum it up,I need to develop a Java code(preferably) for all these algorithms, Then combine all those code modules into one final integrated code and run it. Since I am using this code for my thesis work, I do not need any sorts of GUI. I just want the code to correspond to these algorithms which you can see clearly labelled as Algorithm 1-6 within the paper. After that, I need to perform some changes and compare the results.