Changeset View
Changeset View
Standalone View
Standalone View
libs/image/lazybrush/patched_boykov_kolmogorov_max_flow.hpp
Context not available. | |||||
49 | #include <boost/graph/lookup_edge.hpp> | 49 | #include <boost/graph/lookup_edge.hpp> | ||
---|---|---|---|---|---|
50 | #include <boost/concept/assert.hpp> | 50 | #include <boost/concept/assert.hpp> | ||
51 | 51 | | |||
52 | // The algorithm impelemented here is described in: | 52 | // The algorithm implemented here is described in: | ||
53 | // | 53 | // | ||
54 | // Boykov, Y., Kolmogorov, V. "An Experimental Comparison of Min-Cut/Max-Flow | 54 | // Boykov, Y., Kolmogorov, V. "An Experimental Comparison of Min-Cut/Max-Flow | ||
55 | // Algorithms for Energy Minimization in Vision", In IEEE Transactions on | 55 | // Algorithms for Energy Minimization in Vision", In IEEE Transactions on | ||
Context not available. | |||||
327 | * target(e, m_g) is the beginning of the path found in the sink-tree | 327 | * target(e, m_g) is the beginning of the path found in the sink-tree | ||
328 | * this phase generates orphans on satured edges, if the attached verts are | 328 | * this phase generates orphans on satured edges, if the attached verts are | ||
329 | * from different search-trees orphans are ordered in distance to | 329 | * from different search-trees orphans are ordered in distance to | ||
330 | * sink/source. first the farest from the source are front_inserted into | 330 | * sink/source. first the farthest from the source are front_inserted into | ||
331 | * the orphans list, and after that the sink-tree-orphans are | 331 | * the orphans list, and after that the sink-tree-orphans are | ||
332 | * front_inserted. when going to adoption stage the orphans are popped_front, | 332 | * front_inserted. when going to adoption stage the orphans are popped_front, | ||
333 | * and so we process the nearest verts to the terminals first | 333 | * and so we process the nearest verts to the terminals first | ||
Context not available. |