C++ Reference

C++ Reference: Graph

SimpleMaxFlow

Detailed Description

Definition at line 152 of file max_flow.h.

Public Types

enum  Status { OPTIMAL, POSSIBLE_OVERFLOW, BAD_INPUT, BAD_RESULT }
 

Public Member Functions

 SimpleMaxFlow ()
 
ArcIndex AddArcWithCapacity (NodeIndex tail, NodeIndex head, FlowQuantity capacity)
 
NodeIndex NumNodes () const
 
ArcIndex NumArcs () const
 
NodeIndex Tail (ArcIndex arc) const
 
NodeIndex Head (ArcIndex arc) const
 
FlowQuantity Capacity (ArcIndex arc) const
 
Status Solve (NodeIndex source, NodeIndex sink)
 
FlowQuantity OptimalFlow () const
 
FlowQuantity Flow (ArcIndex arc) const
 
void GetSourceSideMinCut (std::vector< NodeIndex > *result)
 
void GetSinkSideMinCut (std::vector< NodeIndex > *result)
 
FlowModel CreateFlowModelOfLastSolve ()
 
void SetArcCapacity (ArcIndex arc, FlowQuantity capacity)
 

Member Enumeration Documentation

◆ Status

enum Status
Enumerator
OPTIMAL 
POSSIBLE_OVERFLOW 
BAD_INPUT 
BAD_RESULT 

Definition at line 180 of file max_flow.h.

Constructor & Destructor Documentation

◆ SimpleMaxFlow()

Member Function Documentation

◆ AddArcWithCapacity()

ArcIndex AddArcWithCapacity ( NodeIndex  tail,
NodeIndex  head,
FlowQuantity  capacity 
)

◆ Capacity()

FlowQuantity Capacity ( ArcIndex  arc) const

◆ CreateFlowModelOfLastSolve()

FlowModel CreateFlowModelOfLastSolve ( )

◆ Flow()

FlowQuantity Flow ( ArcIndex  arc) const

◆ GetSinkSideMinCut()

void GetSinkSideMinCut ( std::vector< NodeIndex > *  result)

◆ GetSourceSideMinCut()

void GetSourceSideMinCut ( std::vector< NodeIndex > *  result)

◆ Head()

NodeIndex Head ( ArcIndex  arc) const

◆ NumArcs()

ArcIndex NumArcs ( ) const

◆ NumNodes()

NodeIndex NumNodes ( ) const

◆ OptimalFlow()

FlowQuantity OptimalFlow ( ) const

◆ SetArcCapacity()

void SetArcCapacity ( ArcIndex  arc,
FlowQuantity  capacity 
)

◆ Solve()

Status Solve ( NodeIndex  source,
NodeIndex  sink 
)

◆ Tail()

NodeIndex Tail ( ArcIndex  arc) const

The documentation for this class was generated from the following file: