Shortest Path Finder for University of Karachi

🚀 𝙎𝙝𝙤𝙧𝙩𝙚𝙨𝙩 𝙋𝙖𝙩𝙝 𝙁𝙞𝙣𝙙𝙚𝙧 – 𝙈𝙖𝙥𝙥𝙞𝙣𝙜 𝙐𝙣𝙞𝙫𝙚𝙧𝙨𝙞𝙩𝙮 𝙤𝙛 𝙆𝙖𝙧𝙖𝙘𝙝𝙞! 🗺️📍 In my last semester, I developed a Python application to find and visualize the shortest path between locations on the University of Karachi map. This project integrates Dijkstra’s algorithm, OpenCV, and Tkinter to create an interactive navigation tool. 🔹 Project Highlights: ✅ Graph-Based Navigation: The Graph class manages node connectivity and distance calculations. ✅ Dijkstra’s Algorithm: Implements an efficient priority queue to determine the shortest path. ✅ Map Visualization: The Plotter class, powered by OpenCV, plots the path on the university’s map. ✅ User-Friendly Interface: A Tkinter GUI allows users to select start and end locations effortlessly. ✅ Interactive & Practical: Designed specifically for University of Karachi students to navigate the campus efficiently. This project strengthened my understanding of graph theory, algorithms, and GUI development while providing a real-world solution for campus navigation. 🚶♂️🛤️ Have you ever built a similar project? I’d love to hear your thoughts! Let’s connect and discuss. 🤝 #Python #DSA #DijkstrasAlgorithm #Tkinter #OpenCV #UniversityOfKarachi #ShortestPath #GraphTheory #CampusNavigation #Project