https://github.com/ryansilva2004/mappathfinder_using_dsa

Console Application that allows users to add cities to a map, connect cities with paths, and find the shortest path between two cities. It uses Dijkstra’s algorithm for finding the shortest path. The application also allows users to visualize the graph with cities and distances.
https://github.com/ryansilva2004/mappathfinder_using_dsa

data-structures datastructures-algorithms java

Last synced: 3 days ago
JSON representation

Console Application that allows users to add cities to a map, connect cities with paths, and find the shortest path between two cities. It uses Dijkstra’s algorithm for finding the shortest path. The application also allows users to visualize the graph with cities and distances.

• Host: GitHub
• URL: https://github.com/ryansilva2004/mappathfinder_using_dsa
• Owner: RyanSilva2004
• Created: 2024-02-17T09:03:26.000Z (12 months ago)
• Default Branch: main
• Last Pushed: 2024-02-22T16:46:43.000Z (11 months ago)
• Last Synced: 2024-11-28T20:13:20.478Z (2 months ago)
• Topics: data-structures, datastructures-algorithms, java
• Language: Java
• Homepage:
• Size: 126 KB
• Stars: 4
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# PathFinder: Implementing Data Structures for Efficient Geolocation Services

### Features

1. **Add Cities:**

   - Users can add cities to the map by providing a unique city ID and a city name.

2. **Add Paths:**

   - Connect cities with paths, specifying the distance between them. Users can also set the availability of the path.

3. **Display Graph:**

   - Visualize the graph with cities and distances to understand the spatial layout.

4. **Remove Cities:**

   - Remove cities from the map, updating the graph accordingly.

5. **Find Shortest Path:**

   - Utilizes Dijkstra's algorithm to find the shortest path between two cities. Displays the path and total distance.

6. **Persistence:**

   - The graph state is serialized to a file (`graph.ser`) for persistent storage between program runs.

### Data Structures

The Location Pathfinder employs the following data structures:

- **LocationGraph:**

  - Represents the map with an adjacency matrix to store distances between cities.

  - Uses arrays to manage cities and their paths efficiently.

- **City:**

  - Represents a city with a unique ID and a name.

- **Path:**

  - Represents a path between two cities with distance and availability information.

### Getting Started

1. **Compile and Run:**

   - Ensure you have Java installed on your machine.

   - Compile and run the `Main` class to launch the Location Pathfinder.

2. **Menu Options:**

   - Follow the on-screen menu to interact with the application.

   - Options include adding cities, adding paths, displaying the graph, removing cities, and finding the shortest path