Before revision:  The complexity of the proposed algorithm has been reduced to O(\sqrt{2^{k*log_2n . The algorithm automatically generates the circuit for any given undirected and unweighted graph  , which makes the approach generalized in nature.
After revision:  The complexity of the proposed algorithm has been reduced to O(\sqrt{2^{k*log_2n . The algorithm automatically generates the circuit for any given undirected and unweighted graph and any given k , which makes the approach generalized in nature.