All work

Wellington Transport Network

Wellington's public transport as a graph, with route search and the stops whose removal would split the network.

University coursework. Graph and algorithm implementation within a supplied JavaFX framework.

A transport network of connected nodes with the central hub in red.

The graph comes from stops and the connections between them, including walking links within a set distance, which change what counts as connected. A* finds routes.

Connected components and articulation points answer a different question about the same graph, and neither needed the map, though the map is what made any of it readable.

State

Route search and network analysis with a map interface, from April 2023 coursework.

All work