An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.

Not only can a single rainfall process but also erosion and hydrological process in a certain time of cycle be analyzed, the results can be printed in figure, graph or curve.

This paper discusses the application of degree in other aspects of graph theory, such as cycle, Hamiltonian graph and matching on the base of reference.