[ library(gfd) | Reference Manual | Alphabetic Index ]

<ConsistencyModule:> ham_path_g(?Start,?End,+Succ,++CostMatrix,?Cost)

Constrains elements in Succ to form a Hamiltonian path from Start to End with cost Cost. This version uses native Gecode indexing.
An integer or (domain) variable (array notation accepted)
An integer or (domain) variable (array notation accepted)
A collection of N different (domain) variables or integers
A NxN matrix collection of integers.
A )domain) variable or integer (array notation accepted).


This version of ham_path/5 uses the native Gecode indexing, which starts from 0. This is different from normal ECLiPSe's indexing, which starts from 1.

This constraint can be embedded in a constraint expression in its functional form (without the last argument).

See ham_path/5 for a more detailed description of this predicate.


[eclipse 2]: CostM = []([](0,3,5,7),[](4,0,9,6),[](2,1,0,5),[](-7,8,-2,0)),
        ham_path_g(3,2,[1,2,4,0], CostM, C).

CostM = []([](0, 3, 5, 7), [](4, 0, 9, 6), [](2, 1, 0, 5), [](-7, 8, -2, 0))
C = 5

See Also

ham_path / 5