Coursera course: Advanced Data Structure in Java
https://www.coursera.org/learn/advanced-data-structures
Below are the files introduced in each week and used in each week of the course. See file for description...
Before you get started, please refer to this article: Orientation to the Starter Code, Data Files and Front-end
-
basicgraph.Graph.java
-
basicgraph.GraphAdjList.java
-
basicgraph.GraphAdjMatrix.java
-
roadgraph.MapGraph.java
(Implemented methods in this file and run it on searchGrader.java for testing) -
week2example.Maze.java
-
week2example.MazeLoader.java
-
week2example.MazeNode.java
roadgraph.MapGraph.java
(Implemented Dijkstra's algorithm and A* search)roadgraph.MapNode.java
(Modified some variables)roadgraph.MapEdge.java
- Produce the solution to the TSP for a given graph.
- Analyze whether an algorithm optimally solves the TSP
- Analyze the running time for TSP algorithms
- Explain the notion of an NP-Hard problem
- Differentiate between Hamiltonian and Eulerian graphs.
- Describe how a heuristic solution compares to an optimal solution
- Design an extension to your project.
- Develop your extension to your project.
-
geography.GeographicPoint.java
-
geography.RoadSegment.java
-
util.GraphLoader.java
1. Create a new Java Project in your workspace
2. Import the starter files:
File -> Import -> Select "File System" -> Next -> Browse and set
root directory to folder contents of zip were extracted to -> Finish
Feel free to use another IDE or manually compile and run your programs. If you need help, google is your friend.