Skip to content

vasilache-radu/Shortest-Path-Finder

Repository files navigation

Google Maps 2.0 (Romania Edition)

This project is a simplified navigation and visualization tool, built to emulate basic functionality of Google Maps, specifically tailored for Romania. It was developed using the graphics library BGI and demonstrates fundamental pathfinding, UI interaction, and map rendering.

Features

  • 📍 Interactive Main Menu

    • Welcome screen with options to start the navigation or view instructions.
  • 🗺️ Visual Map of Romania

    • Cities are represented as red points on a stylized map.
    • The user-selected route is drawn as a connected path between cities.
  • 🧭 Route Calculation

    • Displays the shortest path from a starting city to a destination, by using the Dijkstra Algorithm, based on a simplified distances file.
    • Shows total distance and travel time (in kilometers and minutes).
    • Each leg of the route includes intermediate city names and the corresponding distance and time.

Example Output

Main Menu

Main Menu

Route Visualization

Route Map

Technologies Used

  • 🖥️ C++ with BGI (Borland Graphics Interface)
  • 🗃️ Static route and map data embedded directly in the code.

Future Improvements

  • Add more cities and route options.
  • Implement dynamic user input for start and end points.
  • Introduce zoom and pan functionality.
  • Use modern graphics libraries (e.g., SDL, SFML) for improved visuals.

Developed by Radu Vasilache as a fun retro mapping project.

About

C++ Implementation of the Dijkstra Algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published