×
Home Discussions Write at Opengenus IQ
×
  • Home
  • 😊 Join our Internship 🎓
  • Machine Learning 🤖
  • Algorithms
  • Data Structures
  • Learn C++
  • Markdown guide

hamiltonian path

A collection of 1 post

algorithm

Hamiltonian Path

Hamiltonian Path is a path in a directed or undirected graph that visits each vertex exactly once. The problem to check whether a graph (directed or undirected) contains a Hamiltonian Path is NP-complete, so is the problem of finding all the Hamiltonian Paths in a graph.

Harshita Sahai Harshita Sahai
×
OpenGenus community button

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ: Learn Computer Science © 2019 All rights reserved â„¢
Top Posts Facebook Twitter