Kirchoff's Theorem calculates number of spanning trees that can be made by a given unweighted (the one without arrows and numbers on edges)