From a163a270ccefd04628f360e1bdf12c581ecdb8ad Mon Sep 17 00:00:00 2001
From: salimt <30296492+salimt@users.noreply.github.com>
Date: Fri, 7 Jun 2019 14:53:06 +0300
Subject: [PATCH] Update README.md
---
README.md | 35 ++++++++++-------------------------
1 file changed, 10 insertions(+), 25 deletions(-)
diff --git a/README.md b/README.md
index cc47cf7..c6a4231 100644
--- a/README.md
+++ b/README.md
@@ -1,28 +1,13 @@
-## University of California, San Diego - Advanced Data Structures in Java
+# Fastest Route Finder with BFS, Djikstra(getting speed limit data from web) and also A Star Algorithms included.
+_this was the final homework for UCSD's Advanced Data Structures in Java._
-
+A basic shortest path finder between given two points. Djikstra has the extra feature of getting data from web, to name it from opensourcemap, if the current coordinates does not have the info of maxspeed then continues to scan around 300 radius uses the closest info.
+Preferred
+7+ Language Level
+SDK 1.8 because of javafx library
+jUnit
+and libs
- INSTRUCTORS
-#### Instructors: Mia Minnes, Leo Porter and Christine Alvarado
+> ### **Example:**
-## Course Description
-
-To solve such problems, we first represent the key pieces of data in a complex data structure. In this course, you’ll learn about data structures, like graphs, that are fundamental for working with structured real world data. You will develop, implement, and analyze algorithms for working with this data to solve real world problems. In addition, as the programs you develop in this course become more complex, we’ll examine what makes for good code and class hierarchy design so that you can not only write correct code, but also share it with other people and maintain it in the future.
-
-The backbone project in this course will be a route planning application. You will apply the concepts from each Module directly to building an application that allows an autonomous agent (or a human driver!) to navigate its environment. And as usual we have our different video series to help tie the content back to its importance in the real world and to provide tiered levels of support to meet your personal needs.
-
-## Done during the course
-
-1. Implement Graphs in Java from scratch.
-2. Analyze the performance of different implementations of Graphs.
-3. Work with Java's built-in classes for fundamental data structures including: HashSet, HashMap, and PriorityQueue.
-4. Design classes to solve a high-level process, including fields, methods, and inheritance relationships.
-5. Describe and implement several algorithms for graph search.
-6. Evaluate the performance of different graph search algorithms in different contexts.
-7. Use graphs and graph algorithms to plan routes using real data.
-
-Final Project:
-
- 
- 
- 
\ No newline at end of file
+ 