  I present a single algorithm which solves the clique problems, "What is the
largest size clique?", "What are all the maximal cliques?" and the decision
problem, "Does a clique of size k exist?" for any given graph in polynomial
time. The existence of this algorithm proves that P = NP.
