Skip to content
This repository has been archived by the owner. It is now read-only.
Implementation of node and edge data structures to create utilities for a train system information centre.
Java
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
doc
resources
src
.gitignore
README.md

README.md

MTR Traversal Coursework

This is our submission for the 2nd year Data Structures and Algorithms module in our CS degree. We were tasked to create utilities for a user to find information about the Hong Kong train system, demonstrating our understanding of the content of labs and lectures (revolving around the Java Collections Framework).

We created a barebones implementation of a node and edge data structure that represents a graph. We chose this approach because the last functional requirement requires finding a path between any two stations, so it made sense if we were implementing a path finding algorithm (where we'd later choose BFS).

Attribution, license and coursework spec can be found in the doc folder.

Made by Dom Meyer, Jarnail Singh and Matthew Barber.

You can’t perform that action at this time.