Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
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 ext::unordered_map<node::Node, ext::unordered_map<node::Node, int> > graph::maximum_flow::Capacity |
using graph::maximum_flow::DirectedGraph = typedef graph::DirectedGraph<node::Node, edge::CapacityEdge<node::Node, int> > |
typedef ext::unordered_map<node::Node, ext::unordered_map<node::Node, int> > graph::maximum_flow::Flow |
using graph::maximum_flow::UndirectedGraph = typedef graph::UndirectedGraph<node::Node, edge::CapacityEdge<node::Node, int> > |