Shortest travel time between metro stations, using Dijkstra's algorithm. Originally my university capstone (Java Swing, Kaohsiung MRT); rewritten as a small, tested, data-driven library + CLI.

On this page, we aim to provide an overview of all PhD dissertations in the Department of Earth Sciences and its Utrecht predecessors. When applicable, a link is provided to the publication in the ...

A collection of clean, self-contained, and runnable algorithm implementations tailored for college Computer Algorithms laboratory practicals and examinations. Each practical is located in its own ...