Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
graph::minimum_cut::FordFulkerson Class Reference

#include <FordFulkerson.hpp>

Static Public Member Functions

static Cut findMinimumCut (const DirectedGraph &graph, const node::Node &source, const node::Node &sink)
 
static Cut findMinimumCut (const UndirectedGraph &graph, const node::Node &source, const node::Node &sink)
 

Member Function Documentation

◆ findMinimumCut() [1/2]

Cut graph::minimum_cut::FordFulkerson::findMinimumCut ( const DirectedGraph &  graph,
const node::Node &  source,
const node::Node &  sink 
)
static

◆ findMinimumCut() [2/2]

Cut graph::minimum_cut::FordFulkerson::findMinimumCut ( const UndirectedGraph &  graph,
const node::Node &  source,
const node::Node &  sink 
)
static
The documentation for this class was generated from the following files:
Generated on Mon Dec 27 2021 10:22:07 for Algorithms Library Toolkit by doxygen 1.9.2