Cycles are fundamental to graph analytics. A cycle is a path with at least 3 vertices and returns to its starting vertex. A cycle captures the circular structural pattern from the starting vertex to itself and is an informative indicator for graph analytics. In light of this, cycle detection has been extensively investigated in the literature for both static and dynamic graphs [1]}, [2]}. The shortest cycle refers to the cycle in a graph with the shortest length (i.e., the minimum number of edges) and the length is also called girth of the graph. The shortest cycle is often employed in graph structure analysis, for example, when solving the graph coloring problem  [3]}, [4]}.
<FIGURE>