Campus-Navigation-System-Java

🧭 Campus Navigation System in Java

This is a console-based Campus Navigation System built using Java. It helps users find the shortest walking path between various buildings and landmarks inside the HITEC University campus using Dijkstra’s Algorithm.

---

📌 Features

• View all campus locations and connected paths
• Calculate the shortest path between two locations
• Displays the total distance in meters
• Simple and interactive console-based user interface

---

💻 Technologies Used

Tool/Technology	Purpose
Java	Core programming language
Dijkstra’s Algorithm	Finding shortest paths
HashMap & PriorityQueue	Efficient graph traversal
Scanner Class	Console input
OOP (Classes, Objects)	Structuring Graph and Navigation

---

🗺️ Campus Locations Modeled

• SE Department
• Rumi Block
• Basketball Court
• Admin Block
• Globe Chowk
• Library
• Israr Block

---

📸 Sample Output

Welcome to HITEC University Navigation System! Please choose an option:

View all locations and stops

Find the shortest path between two locations

Exit

Enter your choice: 2

Enter your current location: SE Department Enter your destination: Library

Calculating the shortest path from SE Department to Library… Shortest Path: SE Department -> Israr Block -> Globe Chowk -> Library Total Distance: 450 meters

This site is open source. Improve this page.