Worked on the paper, 'The Road Coloring Problem' by A. Trahtman. The road coloring problem is the problem of synchronizing coloring of a directed finite strongly connected graph with the same outdegree and where the greatest common divisor of all cycles lengths is 1. The objective was to code in python to find such a synchronizing coloring, considering the landmarks around college as nodes.