Connectivity test for circuit detection

A new connectivity algorithm is proposed for testing whether a circ (a ring sum of two or more f-circuits) of a graph passes for a circuit or not, which is superior to the existing one. The labour involved in the proposed algorithm is proportional to n, as compared to the en of the old algorithm, where e and n represent the number of edges and nodes, respectively, of the graph.