description of hs algorithm
makefile for compilation and testing
test correctness of hs algorithm
start up processes and collect results.

Nearly identical to lcr implementation.
assign each proceess two neighbors

Clockwise and counterclockwise notation was chosen due to the ring network underlying hs.
start up each process with a dummy incoming message
forward outgoing messages if own uid smaller than token uid.

Otherwise drop the message.
return token after MaxCount steps are taken
always forward incoming messages
send token twice as far if previous token returned unscathed
if outgoing message has process's own id it is the leader
if leader message received inform result collector and neighbors
Implement HS leader election algorithm