Rudrata path
Given a graph (undirected graph or directed graph)
a path is a Rudrata path if it visits every vertex exactly once.
Rudrata path
Given a graph (undirected graph or directed graph)
a path is a Rudrata path if it visits every vertex exactly once.