🚉 Stations Pathfinder
A web-based simulation tool for finding optimal train routes. This project demonstrates complex pathfinding algorithms visualized in an interactive web interface.
✨ Key Features
Optimal Pathfinding: Uses Breadth-First Search (BFS) to find the shortest routes.
Collision Avoidance: Implements disjoint path algorithms to prevent trains from sharing
tracks or stations simultaneously.
Smart Scheduling: Automatically balances multiple trains across available unique paths
to
minimize total turns.
Data Validation: Rigorous checking of network map integrity (coordinates, connectivity,
syntax).
Detailed Visualization: Outputs colorful, step-by-step train movement logs in the
terminal.
🛠️ Core Tech Stack
- Language: Go (Golang) 1.20+
- Architecture: Modular design (Pathfinding, Dispatching, Event Logging)
- Dependencies: Zero external dependencies (Standard Library only)
🌐 Web Visualization
An interactive Real-Time Dashboard was built to visualize the algorithms in action.
Front End: Vanilla JavaScript, HTML5 Canvas, CSS3.
Back End: Python http.server for local hosting.
Features: Drag-and-drop map editing, live simulation playback, and responsive train
tracking.
