Maxflow computation based on a standard Adjacency List graph representation. More...

#include <graphcut.hpp>

Public Types
using	NodeType = int

using	ValueType = float

using	Traits = boost::adjacency_list_traits< boost::vecS, boost::vecS, boost::directedS, boost::vecS >

using	edge_descriptor = typename Traits::edge_descriptor

using	vertex_descriptor = typename Traits::vertex_descriptor

using	vertex_size_type = typename Traits::vertices_size_type

using	Graph = boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, boost::no_property, Edge, boost::no_property, boost::vecS >

using	VertexIterator = typename boost::graph_traits< Graph >::vertex_iterator

Public Member Functions
	MaxFlow_AdjList (size_t numNodes)

void	addNodeToSource (NodeType n, ValueType source)

void	addNodeToSink (NodeType n, ValueType sink)

void	addEdge (NodeType n1, NodeType n2, ValueType capacity, ValueType reverseCapacity)

void	printStats () const

void	printColorStats () const

ValueType	compute ()

bool	isSource (NodeType n) const
	is empty

bool	isTarget (NodeType n) const
	is full

Protected Attributes
Graph	_graph

std::vector< boost::default_color_type >	_color

const NodeType	_S

const NodeType	_T

Detailed Description

Maxflow computation based on a standard Adjacency List graph representation.

The documentation for this class was generated from the following file:

/home/docs/checkouts/readthedocs.org/user_builds/alicevision/checkouts/stable/src/aliceVision/panorama/graphcut.hpp

Classes