No Car No Problem
Graph-based shortest path problem on a cylindrical tower with portals.
About this project
Given a cylindrical tower of N floors and P columns with portal connections, the task was to find the minimum sentinel difficulty from (0,0) to (P,N-1). I modeled the tower as a weighted directed graph where each edge weight represents the sentinel difficulty of crossing a connection. Dijkstra's algorithm finds the optimal path, with the cylindrical wrapping handled by taking column indices modulo P.
- Weighted directed graph over cylindrical topology
- Dijkstra's algorithm for minimum-cost path
- Modular column arithmetic for cylindrical wrap-around
Key features
Dijkstra
Optimal shortest path
Graph model
Weighted directed graph
Cylindrical wrap
Modular column index
Tech stack
Other projects
Event Reservation Platform
Full-stack event booking platform with user auth, SCB Sandbox API payment integration, and automated email confirmation.
Real-Time Chat App
Web-based chat app with personal/group rooms, unique identities, and image sharing over WebSockets.