Math 2.0

concept

Hamiltonian cycle

Summary

A Hamiltonian cycle is a cycle that passes through every vertex of a graph. The search for such cycles is a classical hard problem, related to the travelling salesman problem. The node Hamiltonian cycle gives the precise definition.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Hamiltonian_path, Definitions