README.TXT File Reference

#include <stdio.h>
#include "graph.h"

Functions
Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine	Intelligence (PAMI)
Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research you should cite the aforementioned paper in any resulting publication Tested under Visual C compiler and	unix (SunOS 5.8 and RedHat Linux 7.0, GNU c++compiler). 2. License. Copyright 2001 Vladimir Kolmogorov(vnk @cs.cornell.edu)
Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research you should cite the aforementioned paper in any resulting publication Tested under Visual C compiler and Yuri	Boykov (yuri @csd.uwo.ca). This program is free software
either version of the	or (at your option) any later version. This program is distributed in the hope that it will be useful
g	set_tweights (nodes[0], 1, 5)
g	set_tweights (nodes[1], 2, 6)
g	add_edge (nodes[0], nodes[1], 3, 4)
	printf ("Flow = %d\n", flow)
	printf ("Minimum cut:\n")
	if (g->what_segment(nodes[0])==Graph::SOURCE) printf("node0 is in the SOURCE set\n")
else	printf ("node0 is in the SINK set\n")
	if (g->what_segment(nodes[1])==Graph::SOURCE) printf("node1 is in the SOURCE set\n")
else	printf ("node1 is in the SINK set\n")

Variables
Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public	use
Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research	purposes
Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research you should cite the aforementioned paper in any resulting publication Tested under	windows
you can redistribute it and or modify it under the terms of the GNU General Public License as published by the Free Software	Foundation
either version of the	License
either version of the but WITHOUT ANY	WARRANTY
without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE See the GNU General Public License for more details You should have received a copy of the GNU General Public License along with this	program
if	not
if write to the Free Software	Inc
if write to the Free Software Temple	Place
if write to the Free Software Temple	Suite
if write to the Free Software Temple	Boston
Graph *	g = new Graph()
	nodes [0] = g -> add_node()
Graph::flowtype	flow = g -> maxflow()

Function Documentation

add_edge()

g add_edge	(	nodes	[0],
		nodes	[1],
		3	,
		4
	)

Boykov()

Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research you should cite the aforementioned paper in any resulting publication Tested under Visual C compiler and Yuri Boykov

(

yuri @csd.uwo.

ca

)

if() [1/2]

if

(

g->

what_segmentnodes[0] = =Graph::SOURCE

)

if() [2/2]

if

(

g->

what_segmentnodes[1] = =Graph::SOURCE

)

Intelligence()

Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine Intelligence

(

PAMI

)

or()

either version of the or

(

at your

option

)

printf() [1/4]

printf

(

)

printf() [2/4]

printf

(

"Minimum cut:\n"

)

printf() [3/4]

else printf

(

"node0 is in the SINK set\n"

)

printf() [4/4]

else printf

(

"node1 is in the SINK set\n"

)

set_tweights() [1/2]

g set_tweights	(	nodes	[0],
		1	,
		5
	)

set_tweights() [2/2]

g set_tweights	(	nodes	[1],
		2	,
		6
	)

unix()

Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research you should cite the aforementioned paper in any resulting publication Tested under Visual C compiler and unix	(	SunOS 5.8 and RedHat Linux 7.	0,
		GNU c++	compiler
	)

Variable Documentation

Boston

if write to the Free Software Temple Boston

flow

Graph::flowtype flow = g -> maxflow()

Foundation

if write to the Free Software Foundation

g

delete g = new Graph()

Inc

if write to the Free Software Inc

License

either version of the License

nodes

nodes[1] = g -> add_node()

not

if not

Place

if write to the Free Software Temple Place

program

without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE See the GNU General Public License for more details You should have received a copy of the GNU General Public License along with this program

purposes

Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research purposes

Suite

if write to the Free Software Temple Suite

use

Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public use

WARRANTY

either version of the but WITHOUT ANY WARRANTY

windows

Introduction This software library implements the maxflow algorithm described in An Experimental Comparison of Min Cut Max Flow Algorithms for Energy Minimization in Vision Yuri Boykov and Vladimir Kolmogorov In IEEE Transactions on Pattern Analysis and Machine September This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov at Siemens Corporate Research To make it available for public it was later reimplemented by Vladimir Kolmogorov based on open publications If you use this software for research you should cite the aforementioned paper in any resulting publication Tested under windows