×
Home Discussions Write at Opengenus IQ
×
  • RANDOM
  • Join our Internship 🎓
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • #7daysOfCode
  • Linux 💽
  • 🔊 Data Structures
  • Graph Algorithms
  • Dynamic Programming 💑
  • Home

hamiltonian cycle

A collection of 1 post

Algorithms

Hamiltonian Cycle

A Circuit in a graph G that passes through every vertex exactly once is called a "Hamilton Cycle". The Worst Case complexity when used with DFS and back tracking is O(N!).

Avijit Chakraborty
OpenGenus IQ © 2022 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter