findHamiltonianPath: Find Hamiltonian path in network
In jakobbossek/dynvrp: EMOA for a dynamic Orienteering Problem

Given a network instance, a set of nodes to consider and designated start and end nodes the function heuristically determines a shortest Hamiltonian path from start node to end node considering all active nodes.

findHamiltonianPath(instance,
  active.nodes = seq_len(salesperson::getNumberOfNodes(instance) + 2L),
  start.id = 1L, dest.id = 2L, more.args = list(on.ls.failure =
  "stop"))

`instance`	[Network] A netgen network.
`active.nodes`	[`integer`] Node numbers of nodes to be considered.
`start.id`	[`integer(1)`] Node number of start node.
`dest.id`	[`integer(1)`] Node number of destination node.