Hi all, The path constraint has described in MPG page 77 does only gives path from s to e visiting all the nodes. Is there a constraint that gives all the subpaths, not only the Hamiltonians ? (I have an adjacency matrux and i need to find all path/subpath from s to e) Thank you
_______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
