[2024 Day 23] Learned something new today

A clique in a graph is a subset of vertices such that every two distinct vertices in the subset are adjacent (i.e., there's an edge between every pair).

A maximal clique is a clique that cannot be extended by adding any more vertices from the graph while maintaining the property that every two vertices in the subset are adjacent.

A maximum clique is the largest clique in the graph, meaning it is a clique that contains the greatest number of vertices of any clique in the graph.

Here's my (over-engineered) code in Go. Reviews are welcome.