Join GitHub today
GitHub is home to over 40 million developers working together to host and review code, manage projects, and build software together.Sign up
No description, website, or topics provided.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
|Type||Name||Latest commit message||Commit time|
|Failed to load latest commit information.|
Project Overview: UC Berkeley CS 61B Project 3 - "Bear Maps v2.0" (Spring 2017, Prof. Josh Hug): Using Java to implement the back end of a web mapping application that calculates and displays the shortest path to a destination. Front end logic is provided by CS 61B staff, and data is obtained from OpenStreetMap. The three main parts of the project are... 1.) "Map Rastering" - Providing the front end with the correct set of map images depending on the user's query. 2.) "Graph Building" - Organizing data extracted from OpenStreetMap into a Graph structure with adjacency lists for each node. 3.) "Route Search" - Implementing the A* search algorithm to calculate an optimal route between start and destination. SCORE: 85.0 / 75.0 * Awarded extra credit for passing additional test cases for extra features. * Graded on Gradescope using UC Berkeley's public autograder. Project Specifications: http://datastructur.es/sp17/materials/proj/proj3/proj3.html (or proj3.htm in the main directory) =============================================================================== How to Run: See Project Specifications on how to open/run the project in IntelliJ.