Pangiotis

i am totally confused is there any github example to take a look or any sample of the basic code.

thanks for this approach, but my problem has equal weights(1 for all) of each edge. Consider this approach to briefly understand it here . What do you suggest for this approach?

what do i need to use to solve the graph partition problem instead of sets then? i will appreciate a lot if you might give me some directions

yes but what about if i want to add multiple edges for my graph partion problem except from {1.3}. For example i want to have to simulate edges of the graph d :: {{1,3}..{2,4}..{3,2} etc }.what i do in this occasion? i was trying to do d.unionAdapt(1,3); d.unionAdapt(2,4); but it not works for the second element

i am trying to simulate the The Graph Partitioning Problem but i am bit confused. i defined a collection of integers using "Set Constraints" but my problem is that Set with BoundSetDomain is defined with glb(d) = {1}, set containing element 1, and lub(d) = {1..3}, set containing elements 1, 2 and 3. For example, i want to have exaclty a set of {1,3} and not {1..3}, with 1, 2 and 3. What can i do here can you help me?