I recently discoverd the graph-tool library so first of all congratulation
for this development and the nice documentation.
As a non "graph" guy I'm currently facing some trouble trying to adapt an
energy minimization problem using the boykov_kolmogorov_max_flow function.
The goal is to reproduced the work of this paper
(page 3) which uses the max flow function on an 8 connected image where
each pixels are discribed by a discrete value (0 or 1) and a probability.
I'm still wondering what's the best way to create an 8-connected graph from
an array and how to deal with the dual description of the pixels.
I some of you have some tips to share, i would gladely listen to them.
Thanks in advance,
attachment.html (939 Bytes)