#include <ogdf/graphalg/MaxFlowModule.h>
|
| MaxFlowModule () |
| Empty Constructor. More...
|
|
| MaxFlowModule (const Graph &graph, EdgeArray< T > *flow=nullptr) |
| Constructor that calls init. More...
|
|
virtual | ~MaxFlowModule () |
| Destructor that deletes m_flow if it is an internal flow array. More...
|
|
T | computeFlow (EdgeArray< T > &cap, node &s, node &t, EdgeArray< T > &flow) |
| Only a shortcut for computeValue and computeFlowAfterValue. More...
|
|
virtual void | computeFlowAfterValue ()=0 |
| Compute the flow itself after the flow value is already computed. Only used in algorithms with 2 phases. The flow is stored in the array that the user gave in the constructor. More...
|
|
void | computeFlowAfterValue (EdgeArray< T > &flow) |
| Compute the flow itself after the flow value is already computed. Only used in algorithms with 2 phases. The flow is stored in the parameter flow . More...
|
|
virtual T | computeValue (const EdgeArray< T > &cap, const node &s, const node &t)=0 |
| Compute only the value of the flow. More...
|
|
virtual void | init (const Graph &graph, EdgeArray< T > *flow=nullptr) |
| Initialize the problem with a graph and optional flow array. If no flow array is given, a new ("internal") array will be created. If a flow array is given, the algorithm uses this "external" array. More...
|
|
bool | isFeasibleInstance () const |
| Return whether the instance is feasible, i.e. the capacities are non-negative. More...
|
|
void | useEpsilonTest (const double &eps) |
| Change the used EpsilonTest from StandardEpsilonTest to a user given EpsilonTest. More...
|
|
template<typename T>
class ogdf::MaxFlowModule< T >
Definition at line 40 of file MaxFlowModule.h.
◆ MaxFlowModule() [1/2]
◆ MaxFlowModule() [2/2]
Constructor that calls init.
- Parameters
-
graph | is the graph for the flow problem. |
flow | is an optional argument that can be used to force the algorithm to work on an user given "external" EdgeArray flow |
Definition at line 71 of file MaxFlowModule.h.
◆ ~MaxFlowModule()
Destructor that deletes m_flow if it is an internal flow array.
Definition at line 77 of file MaxFlowModule.h.
◆ computeFlow()
Only a shortcut for computeValue and computeFlowAfterValue.
- Returns
- The value of the flow.
- Parameters
-
cap | is the EdgeArray of non-negative capacities. |
s | is the source. |
t | is the sink. |
flow | A copy of the "internal" flow array is given in flow . |
Definition at line 164 of file MaxFlowModule.h.
◆ computeFlowAfterValue() [1/2]
◆ computeFlowAfterValue() [2/2]
Compute the flow itself after the flow value is already computed. Only used in algorithms with 2 phases. The flow is stored in the parameter flow
.
- Parameters
-
flow | The "internal" flow array is given in flow . |
Definition at line 140 of file MaxFlowModule.h.
◆ computeValue()
◆ destroy()
◆ init()
Initialize the problem with a graph and optional flow array. If no flow
array is given, a new ("internal") array will be created. If a flow
array is given, the algorithm uses this "external" array.
- Parameters
-
graph | is the graph for the flow problem. |
flow | is an optional argument that can be used to force the algorithm to work on an user given "external" EdgeArray flow |
Reimplemented in ogdf::MaxFlowSTPlanarDigraph< TCap >.
Definition at line 87 of file MaxFlowModule.h.
◆ isFeasibleInstance()
Return whether the instance is feasible, i.e. the capacities are non-negative.
Definition at line 147 of file MaxFlowModule.h.
◆ useEpsilonTest()
◆ doingAReInit
◆ m_cap
◆ m_et
◆ m_flow
◆ m_G
◆ m_s
◆ m_t
◆ usingExternFlow
Is an extern flow array given in the constructor?
Definition at line 50 of file MaxFlowModule.h.
The documentation for this class was generated from the following file: