idmitrievsky / graphcut Goto Github PK

In Partition::mutate while iterating throwgh all pixels, I should set weights only for neighbour pixels on the right and below, because weights are symmetric, thus left and above neighbours are already set.

Ford-Fulkerson variants can be speeded up by using linkcut trees data structure.

Changes made to support undirected graphs might break things for directed.

In some code pieces these calls expect to get all four pixels, not just two like in filling in part.

Maximum flow (Edmonds–Karp) algorithm may be not the right choise. I should implement some other options (like Stoer-Wagner) for tests and make a decision based on the results.

I should test this class and remove templates from it.

I should inherit from Network class and provide a constructor for this new class. It should accept image as an argument and build a graph as in graph cut algorithm.