Commit e069fcd

committed

Create README.md

1 parent c93c4d8 commit e069fcdCopy full SHA for e069fcd

File tree

-0

lines changed

-0

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,5 @@`
	`1`	`+# Hamiltonean Cycles`
	`2`	`+A Hamiltonean Path is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete.`
	`3`	`+`
	`4`	`+## References`
	`5`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Hamiltonian_path)`

Comments

(0)