Welcome to the Karachi City Navigation application, a sophisticated graphical user interface (GUI) designed for seamless path navigation within the dynamic city of Karachi. This application is equipped with two powerful functionalities: pathfinding using Dijkstra's Algorithm and the generation of a minimum spanning tree using Prim's Algorithm.
- All Paths: Discover the shortest paths from a chosen starting point to all other locations within Karachi.
- Specific Paths: Identify the shortest route between two specified locations within the city.
Generate a minimum spanning tree for the city, emphasizing vital connections between diverse locations.
To run the application locally, follow these steps:
git clone https://github.com/your-username/karachi-city-navigation.git
Ensure you have Python installed. Install necessary libraries using:
pip install -r requirements.txt
Execute the main file:
python main.py
Choose the Algorithm Select either Dijkstra's Algorithm or Prim's Algorithm from the user-friendly interface.
- For discovering all paths: Choose "All Paths" and specify a starting point.
- For specific paths: Select "Specific Paths" and input the start and end locations.
Choose "Minimum Spanning Tree" to generate a visual representation of the minimum spanning tree for Karachi.
The application will elegantly display the paths or the minimum spanning tree graphically on the intuitive GUI.
Contributions are encouraged! Whether you have suggestions, feature requests, or have identified a bug, please open an issue or submit a pull request.
This project is licensed under the MIT License.
Special gratitude to all for their invaluable inspiration, guidance, or data utilized in the development of this project.
For any inquiries, please feel free to reach out to me at:[email protected]