6 Mar
2007
6 Mar
'07
9:06 p.m.
Hi! It seems there is an inconsistency (to me) between color tagging of vertices in edmund_karp_max_flow and kolmogorov_max_flow algorithms. In the documentation of kolmogorov_max_flow, it says: "If the color of a vertex after running the algorithm is white the vertex belongs to the source tree else it belongs to the sink-tree (used for minimum cuts)." In short, vertices linked to the source are white. However, for edmund_karp_max_flow, it says: "At the end of the algorithm, the white vertices define the minimum cut set." Thus in this case, it's the vertices connected to the sink that are white. Why the difference in color tagging between the two algorithms? -- François Duranleau LIGUM, Université de Montréal