İptal Edildi

I would like to hire a Programmer

In this problem you will implement Dijkstra's algorithm to find shortest paths between pairs of cities on a map. We are providing a a GUI that lets you visualize the map and the path your algorithm finds between two cities.

Before you start:

Download and unpack the file [url removed, login to view] in a new window, which contains the GUI, a graph implementation, and data files representing a map. The file [url removed, login to view] contains a list of cities and their (X,Y) coordinates on the map. These are the vertices in the graph. The file [url removed, login to view] lists direct, connections between pairs of cities. These links are bidirectional, if you can from NewYork to Boston, you can get from Boston to NewYork. These are the edges of the graph.

If you use an IDE, import the java files and make sure that [url removed, login to view] and [url removed, login to view] are placed in the project directory. If you use java and javac from the command line put the files in the same directory as the source files.

Compile all java sources and run the program Display. This should bring up a window and display the map. You will notice that clicking on "Compute All Euclidean Distances" does nothing and that "Draw Dijkstra's Path" will throw a null pointer exception on the terminal. You will have to implement these methods yourself.

Carefully read through the classes [url removed, login to view] and [url removed, login to view], which represent the vertices and edges of a graph. You will not have to modify these classes for the assignment, but you need to understand how the graph is represented and what information is associated with each vertex and edge. If you do modify these files, please explain in the README.

You will only have to modify [url removed, login to view], which represents a graph and will contain your implementation of Dijkstra's algorithm. You will need to use the instance variable vertexNames, which contains a mapping from city names to Vertex objects after the graph is read from the data files. The main method of Dijkstra illustrates how the class is used by the GUI and might be useful for testing your implementation on the command line.

a. Implement the method computeAllEuclideanDistances() which should compute the euclidean distance between all cities that have a direct link and set the weights for the corresponding edges in the graph. Once this works correctly, the correct distances should be displayed in the GUI when clicking on "Compute All Euclidean Distances".

b. In the method doDijkstra(String s), implement Dijkstra's algorithm starting at the city with name s. Use the distances associated with the edges. The method should update the distance and prev instance variables of the Vertex objects. You do not have to use a priority queue to store vertices that still need to be visited. Instead, keep these vertices on a list and scan through the entire list to find the minimum. We are making this simplification (at the expense of runtime) because [url removed, login to view] does not support the decreaseKey operation.

c. Implement the method getDijkstraPath(String s, String t), which first calls doDijstra(s) and then uses the distance and prev instance variables of the Vertex objects to find the shortest path between s and t. The resulting path should be returned as a list of Edge objects. Once this works correctly, you should be able to compute and display paths in the GUI.

Beceriler: Java, Programlama

Daha fazlasını görün: hire a programmer to make an app, best place to hire a programmer, i need a computer programmer, hire freelance programmer, i need a programmer to develop a program for me, how to hire a programmer for a startup, software programmers hire, how much does it cost to hire a programmer, hire programmer poly, hire programmer firefox extension, hire programmer auction, hire programmer india 2009, hire programmer iphone, firefox addons hire programmer

İşveren Hakkında:
( 0 değerlendirme ) United States

Proje NO: #14884077

22 freelancer bu iş için ortalamada 26$ teklif veriyor

it2051229

Hi there, I went through the files and requirements and I can definitely do this one. I know Dijsktra algorithm very well and have implemented projects related to it. Let me know if you are interested Relevant Skills Daha fazlası

1 gün içinde 30$ USD
(965 Değerlendirme)
7.5
1 gün içinde 60$ USD
(50 Değerlendirme)
5.1
wenjing325

Dear sir I would like to tell you this project is very interesting and easy for me I am a java expert and have rich experiences in this field I can do this project on time with high quality. Relevant Skills and Experi Daha fazlası

1 gün içinde 25$ USD
(22 Değerlendirme)
3.8
Robertxs

I can do your dijkstra's algorithm Stay tuned, I'm still working on this proposal.

1 gün içinde 35$ USD
(6 Değerlendirme)
3.3
1 gün içinde 35$ USD
(10 Değerlendirme)
3.4
1 gün içinde 30$ USD
(1 Değerlendirme)
2.4
abhinavjohri

would like to hire a Programmer Relevant Skills and Experience Product Developer (Core JAVA, Hibernate, WebServices ( RESTFul ), AGILE) • 6 years 2 months experience in Product Development & test-suite automation. Daha fazlası

1 gün içinde 15$ USD
(4 Değerlendirme)
2.5
lingung525

Hi Greeting of the day!! Thank's for providing me an opportunity to bid on your project. Relevant Skills and Experience I am very familiar with Dijkstra algorithm. I can help you with high quality. Proposed Milest Daha fazlası

1 gün içinde 25$ USD
(5 Değerlendirme)
2.9
adiskrastic

Hello It's my great pleasure to help you I've many experiences in java programming for 10 years This is easy project and I can do it Please contact me Thank you. Relevant Skills and Experience java Proposed Mileston Daha fazlası

1 gün içinde 25$ USD
(4 Değerlendirme)
2.5
mathDev00

Dear sir. I am very interested to your project. I have a good skill and experience in java programming. I can finish this project in perfect. Please contact me. Thanks. Stay tuned, I'm still working on this proposal.

1 gün içinde 30$ USD
(1 Değerlendirme)
0.8
1 gün içinde 50$ USD
(1 Değerlendirme)
0.4
1 gün içinde 25$ USD
(0 Değerlendirme)
0.0
gd015828

I have more than 5 years of exp and I am working in product based company. I have good knowledge of algorithms. Relevant Skills and Experience java algo data structure Proposed Milestones $10 USD - full

1 gün içinde 10$ USD
(0 Değerlendirme)
0.0
teknosoft5

Dear Prospect Hiring Manager. Thank you for giving me a chance to bid on your project. I am a serious bidder here and i have already worked on a similar project before and can deliver as u have mentioned I have c Daha fazlası

in 6 gün içinde28$ USD
(0 Değerlendirme)
0.0
sahitiks6

i have already implemented the algorithm in java.

in 3 gün içinde10$ USD
(0 Değerlendirme)
0.0
muneeb0303

A proposal has not yet been provided

1 gün içinde 25$ USD
(0 Değerlendirme)
0.0
1 gün içinde 20$ USD
(0 Değerlendirme)
0.0
vasundharamehta

I have already implemented this as you had given the source files. Just one question is it okay to use an inner class for the doDijkstra(String s) function, I found it easier to use than lists. Relevant Skills and Exp Daha fazlası

1 gün içinde 14$ USD
(0 Değerlendirme)
0.0
Suraj419

i have one year experience in java programming. so i will do this easly. Relevant Skills and Experience c programing, java programing, RDBMS, mysql Proposed Milestones $15 USD - i have already done project on java pr Daha fazlası

1 gün içinde 15$ USD
(0 Değerlendirme)
0.0
tuanthanhle

I can do it quickly Stay tuned, I'm still working on this proposal.

1 gün içinde 20$ USD
(0 Değerlendirme)
0.0