Algorithms Library Toolkit: graph::minimum_cut Namespace Reference

Algorithms Library Toolkit

A toolkit for algorithms, especially for algorithms on formal languages

Data Structures
class	FordFulkerson

Typedefs
typedef std::unordered_set< std::pair< node::Node, node::Node > >	Cut

using	UndirectedGraph = graph::UndirectedGraph< node::Node, edge::CapacityEdge< node::Node, int > >

using	DirectedGraph = graph::DirectedGraph< node::Node, edge::CapacityEdge< node::Node, int > >

Typedef Documentation

◆ Cut

typedef std::unordered_set<std::pair<node::Node, node::Node> > graph::minimum_cut::Cut

◆ DirectedGraph

using graph::minimum_cut::DirectedGraph = typedef graph::DirectedGraph<node::Node, edge::CapacityEdge<node::Node, int> >

◆ UndirectedGraph

using graph::minimum_cut::UndirectedGraph = typedef graph::UndirectedGraph<node::Node, edge::CapacityEdge<node::Node, int> >