An interactive Java Swing application that helps users find the shortest and most efficient routes between metro stations using classic graph traversal algorithms. The application visually simulates pathfinding using Dijkstra, Breadth-First Search (BFS), and Depth-First Search (DFS), making it easy to understand how each algorithm explores the metro network.

✨ Features User-friendly GUI built with Java Swing

Select source and destination metro stations from dropdowns

Supports Dijkstra, BFS, and DFS algorithms for pathfinding

Animated station traversal and live path updates

Visual representation of metro stations and routes using a custom-drawn graph

🛠️ Technologies Used Java

Java Swing (GUI)

Graph Data Structures and Algorithms