Skip to content

A Qt-based C++ application for managing cities and distances, with shortest path calculation using Dijkstra's algorithm and graph traversal with BFS/DFS.

Notifications You must be signed in to change notification settings

ziaddevv/wasalney_mini_Path_Finder

Repository files navigation

🏙️ City Path Finder (Qt Version)

A Qt-based C++ console application that helps users manage cities and distances, and find the shortest path using Dijkstra’s algorithm. The program includes graph traversal with BFS/DFS, full graph editing capabilities, and a simple Qt-based interface.

✅ Features

  • Represent graph using an adjacency list
  • Add, update, or delete cities and distances
  • Traverse the graph using BFS or DFS
  • Find the shortest path with Dijkstra’s Algorithm
  • Save/load graph data with file I/O
  • Simple Qt-based user interface

📌 Notes

  • Uses Qt for the graphical interface
  • Saves data automatically and reloads it on startup
  • Designed for continuous use until manual exit

💻 Requirements

  • Qt 5.15 or later
  • C++11 or later
  • Standard libraries (no external dependencies)

🔄 How to Run

  1. Clone the repository:
    git clone https://github.com/your-username/City-Path-Finder.git

About

A Qt-based C++ application for managing cities and distances, with shortest path calculation using Dijkstra's algorithm and graph traversal with BFS/DFS.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •