Algorithms Term Project

Traversing a (finite) directed or undirected graph by passing through each vertex exactly once results in a Hamiltonian Path. Hamiltonian Path Problem is an NP-Complete problem. We analyzed a randomized approximation algorithm both theoratically and experimentally.

In order to access the github repo, click here