Solving day 23

[truggeri]

Summary

Solved using two data structures,

1. A map keyed on a computer identifier and containing a slice (vector, list) of all the connected machines.
2. A map keyed on the connection between two computers and containing true

This allows us to iterate through ever computer connected to a t computer and in O(1) time look up if those computers are connected. The tricky bit is identifying double or triple counts.