`FindHamiltonianPath[g]` gives the vertices of one path that visits every
Avviker fra .wl-referansen: `FindHamiltonianPath` choice
FindHamiltonianPath[g]
FindHamiltonianPath[g, s, t]
{FindHamiltonianPath[CycleGraph[4]], FindHamiltonianPath[Graph[{1 <-> 2, 3 <-> 4}]]}
→ {{1, 2, 3, 4}, {}}FindHamiltonianPath[Graph[{1 -> 2, 2 -> 3}]]
→ {1, 2, 3}{FindHamiltonianPath[Graph[{1 <-> 2, 2 <-> 3}], 3, 1], FindHamiltonianPath[Graph[{1 <-> 2, 2 <-> 3}], 2, 3]}
→ {{3, 2, 1}, {}}