Program for calculating the number of feasible configurations in a nxn lattice graph where no neighbours can be occupied at the same time. This type of graph is used in the hardcore model.

Usage:

• cargo run