FindHamiltonianCycle

 FindHamiltonianCycle(graph)

find an hamiltonian cycle in the graph.

See

• Wikipedia - Hamiltonian path
• Wikipedia - Hamiltonian path problem

Examples

>> FindHamiltonianCycle( {1 -> 2, 2 -> 3, 3 -> 4, 4 -> 1} )
{1->2,2->3,3->4,4->1}

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindEulerianCycle, FindVertexCover, FindShortestPath, FindShortestTour, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of FindHamiltonianCycle