👉 A clique is a set of vertices in a graph that are connected by exactly one edge. In other words, it's a subset of vertices that contains all possible paths between any two vertices. An example of a clique is a set of four vertices {a, b, c, d} where a and b are adjacent, and c and d are adjacent. This set satisfies the definition of a clique because it contains all possible paths from vertex a to vertex b (b-a-c-d) and
