A naukri.com initiative
Prodevelopertutorial
2w
253
Image Credit: Prodevelopertutorial
Graph data structure tutorial 10. Hamiltonian Graph
- A graph that contains Hamiltonian circuit is called as Hamiltonian graph.
- A path that passes through every vertex exactly once is called as Hamiltonian circuit.
- If a graph has a Hamiltonian path, it means it visits all the vertices, but cannot return to the initial vertex.
- Finding a Hamiltonian circuit or path is a NP complete problem.
Read Full Article
15 Likes
For uninterrupted reading, download the app