Rudrata path

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