Before revision:  An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph  which makes the approach generalized in nature for Maximum Clique Problem.
After revision:  An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph , which makes the approach generalized in nature for Maximum Clique Problem.