segmentation debug
————Newcomposed CSP begin:——— v:8 c_{3,4}[8]-1 cjk[v]-1 cjk[cij[v]]41 c_ik[v]-1 c_{3,6}: [ 0 8] c_{3,6}: [ 1 1] c_{3,6}: [ 2 3] c_{3,6}: [ 3 -1] c_{3,6}: [ 4 -1] c_{3,6}: [ 5 3] c_{3,6}: [ 6 4] c_{3,6}: [ 7 -1] c_{3,6}: [ 8 -1] ++++++++++++++++++ ++++++++++++++++++++++++++++++++++++++++++++ typecons=:2 removed v : 0 reviseDomain(i,k); L.QLength() : 1 Queue is empty. ++++++8+++++++++++++++++++++++ O.Qlength=6 head=4 adjGF[i]: 2 O print: 7->8->6->5->2->NULL end: O print L print: 3->6->NULL end: L print starting L.QLength() : 1 i=4 j=3 k=4 functional[j*n+k] && (wasIn[k])1—1 ++++6+++++++++++++++++++++++++K 4 i=4 j=3 k=8 functional[j*n+k] && (wasIn[k])0—1 +++++7+++++++ k +++++++++++++++++8 L.QLength() : 2 4->NULL starting L.QLength() : 0 i=4 j=4 k=2 functional[j*n+k] && (wasIn[k])0—1 i=4 j=4 k=3 functional[j*n+k] && (wasIn[k])1—0 i=4 j=4 k=6 functional[j*n+k] && (wasIn[k])1—0 L.QLength() : 0 Queue already empty. Queue is empty. ++++++8+++++++++++++++++++++++ O.Qlength=5 head=7 adjGF[i]: 0 O print: 8->6->5->2->NULL end: O print L print: Queue is empty. end: L print ++++++8+++++++++++++++++++++++ O.Qlength=4 head=8 adjGF[i]: 1 O print: 6->5->2->NULL end: O print L print: 3->NULL end: L print starting L.QLength() : 0 i=8 j=3 k=4 functional[j*n+k] && (wasIn[k])1—0 +++++7+++++++ k +++++++++++++++++4 ————Origin cij:———
