# small test instance for the shortest Hamiltonian path problem
# it represents a complete bidirected graph on 5 vertices with symmetric cost values
set V:= 1 2 3 4 5;
param s:= 1;
param t:= 5;
# start and target node must be different.
param: A: c: # implicit definition of A via c: There is an arc for each cell with an entry for c.
1 2 3 4 5:=
1 . 2 3 3 1
2 2 . 1 2 2
3 3 1 . 2 3
4 3 2 2 . 2
5 1 2 3 2 .;