# Rudrata cycle

Given a graph (undirected graph or directed graph ) $G = (V,E)$, a cycle $c$ is a Rudrata cycle if it visits every vertex exactly once.