[gecode-users] Graph Connectivity Problem

[Halit Erdogan]

Dear All,

Although it seems a very common problem I could not find any  
information on forcing graph connectedness neither in documentation  
nor in the web archive.

The problem is: I have a matrix "m" representing an undirected graph.  
m(i,j) = 1 means there is an edge between the vertices i and j. I want  
m to represent a connected graph (every pair of distinct vertices in  
the graph ( (i,j) in m) is connected through some path). How can I  
write this as a constraint in gecode?

thanks in advance,
-halit



-- 
Halit Erdogan
B.S. Sabanci University
Computer Science and Engineering

email   : halit at su.sabanciuniv.edu
phone   : +90 505 476 75 76
webpage : http://students.sabanciuniv.edu/~halit/