feat-hamilitonian_cycle

[ArpitaHanjagi]

This R program uses backtracking to find a Hamiltonian Cycle in a graph.
A Hamiltonian Cycle is a path that visits every vertex exactly once and returns to the starting vertex.

The graph is given as an adjacency matrix, and the algorithm recursively tries to build a valid cycle by checking:

if the next vertex is connected to the previous one, and

if it hasn’t been visited before.

If a full cycle is found, it returns the vertex order; otherwise, it reports that no cycle exists.

Time Complexity: O(N!)
Space Complexity: O(N)

[siriak]

Looks good, thanks!