hamiltonian_path (312B)
1 # Hamiltonian path 2 3 A [simple_path] that goes via all vertices of a [graph] 4 5 The [computational_problem] of [deciding] whether such a path exists in an input [undirected_graph] is [np_complete] 6 7 See also: [hamiltonian_cycle], [traveling_salesperson_problem], [k_path], [path_length], [eulerian_path] 8 9 Up: [path]