Java works/programming and bundle them together - open to bidding
$30-250 USD
Paid on delivery
hi there.........I need Java programmers, that knows how to manipulate algorithm with respect to some given graph. You will have some code and you will add to it. You will produce some simple graph result too. This is a continuing work if you do very well we are in for a long time work especially on Java program etc.
Basically you are going to edit, build some Java softwares together, add some class, function to produce desired result using some algorithms; then produce some results in the form of graph. I placed the type of graph results needed in the attachment. The algorithms to work/code on may need some more adjustment of the function in the program to produce required results. e.g like the chart or histogram in the attachment. please do check the attached document, we will follow the document with some little modification as required. Attached file will be of help to finish the work quickly especially with finding the path in a graph. It is a form of MODIFIED Dijkstra algorithm.
Algorithm 1 is just like the given “Bhandari
Java file” but with K paths
◦ that is; not just for 2 paths
algorithm 2 shows the level where the path
found must be K,
◦ k is any given value
◦ also we have a value “a” that is added to
each path as the algorithm is run
algorithm 3 add another set
PLEASE USE FIBONACCI HEAP if
possible instead of Binary Heap that was
used .
◦ for the priority queue
◦ [url removed, login to view]
[url removed, login to view]
other resource page
◦ [url removed, login to view]
Project ID: #6751212
About the project
4 freelancers are bidding on average $159 for this job
Hello. I am interested in your job. I have a lot of experiences in Java programming. check my portfolio. if u'd like to work with me, give me some words. Thanks.
Hi, I'm a senior Java developer with 8 years of rich experiences. I'm interested in your project. I will do a perfact work for you. Please check my porfolio/work history for more details about me.