search

AlgoGenesis / C

AlgoGenesis is a centralized open-source platform dedicated to providing optimized and well-documented algorithm implementations in C. Perfect for both beginners and advanced users, this repository serves as a comprehensive learning resource for solving algorithmic challenges.
MIT License
91 stars 304 forks source link

[NEW ALGORITHM] Hamiltonian Path/Cycle Problem #1751

Open surbhisharma004 opened 2 hours ago

surbhisharma004 commented 2 hours ago

Issue will be closed if:

1) You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2) You propose an algorithm that is already present or has been mentioned in a previous issue.
3) You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

Name:

[NEW ALGORITHM] Hamiltonian Path/Cycle Problem Algorithm

About:

Propose a new algorithm to be added to the repository The Hamiltonian Path problem asks if there exists a path in a graph that visits each vertex exactly once. A Hamiltonian Cycle is a special case where the path also returns to the starting vertex, forming a cycle. The problem is NP-complete, meaning there is no known efficient solution for large graphs. It is typically solved using backtracking, where all possible paths are explored, and the algorithm backtracks when it encounters an invalid path.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

Assignees:

surbhisharma004 commented 2 hours ago

@pankaj-bind please assign this issue to me.