##FIT2004
- Implemented dijikstra modified for their being another route which requires a passenger to be picked up.
- Dynamically determined which columns to get rid of in a mockup of a vertical office building. Given the values of capacities in each room then maximise the space left whilst also satisfying that the above row must be adjacent to the one below.
- Determining the max throughput from the list of data centres and their connnections given their max for in and out. Implemented using a modified ford fulkerson method to find max flow.
- Prefix matching with tries.