Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Typedefs | Enumerations
graph::maximum_flow Namespace Reference

Data Structures

struct  Context
 
class  FordFulkerson
 

Typedefs

typedef ext::unordered_map< node::Node, ext::unordered_map< node::Node, int > > Capacity
 
typedef ext::unordered_map< node::Node, ext::unordered_map< node::Node, int > > Flow
 
using UndirectedGraph = graph::UndirectedGraph< node::Node, edge::CapacityEdge< node::Node, int > >
 
using DirectedGraph = graph::DirectedGraph< node::Node, edge::CapacityEdge< node::Node, int > >
 

Enumerations

enum  State { FRESH , OPEN , CLOSED }
 

Typedef Documentation

◆ Capacity

◆ DirectedGraph

◆ Flow

◆ UndirectedGraph

Enumeration Type Documentation

◆ State

Enumerator
FRESH 
OPEN 
CLOSED