Loading...
Searching...
No Matches
Here is a list of all documented enum values with links to the class documentation for each member:

### - a -

- ALTERING_LIST : NetworkSimplex< GR, V, C >
- AUGMENT : CostScaling< GR, V, C, TR >

### - b -

- BASIC : LpSolver
- BEST_ELIGIBLE : NetworkSimplex< GR, V, C >
- BLOCK_SEARCH : NetworkSimplex< GR, V, C >

### - c -

- CANCEL_AND_TIGHTEN : CycleCanceling< GR, V, C >
- CANDIDATE_LIST : NetworkSimplex< GR, V, C >
- CHEAPEST : InsertionTsp< CM >
- CIRCLE : GraphToEps< T >

### - d -

- DEGREE_BASED : GrossoLocatelliPullanMc< GR >
- DIAMOND : GraphToEps< T >

### - e -

- EVEN : MaxMatching< GR >

### - f -

- FARTHEST : InsertionTsp< CM >
- FEASIBLE : LpSolver, MipSolver
- FEMALE : GraphToEps< T >
- FIRST_ELIGIBLE : NetworkSimplex< GR, V, C >
- FIXED : LpSolver
- FREE : LpSolver

### - g -

- GEQ : NetworkSimplex< GR, V, C >

### - h -

- HELP : ArgParserException

### - i -

- IN_HEAP : BinHeap< PR, IM, CMP >, BinomialHeap< PR, IM, CMP >, BucketHeap< IM, MIN >, Heap< PR, IM, CMP >, DHeap< PR, IM, D, CMP >, FibHeap< PR, IM, CMP >, PairingHeap< PR, IM, CMP >, QuadHeap< PR, IM, CMP >, RadixHeap< IM >, SimpleBucketHeap< IM, MIN >
- INFEASIBLE : CapacityScaling< GR, V, C, TR >, CostScaling< GR, V, C, TR >, CycleCanceling< GR, V, C >, LpSolver, MipSolver, NetworkSimplex< GR, V, C >
- INTEGER : MipSolver
- INVALID_OPT : ArgParserException
- ITERATION_LIMIT : GrossoLocatelliPullanMc< GR >, HowardMmc< GR, CM, TR >

### - l -

- LEQ : NetworkSimplex< GR, V, C >
- LOWER : LpSolver

### - m -

- MALE : GraphToEps< T >
- MAT : DimacsDescriptor
- MATCHED : MaxMatching< GR >
- MAX : DimacsDescriptor, LpBase
- MESSAGE_ERROR : LpBase
- MESSAGE_NORMAL : LpBase
- MESSAGE_NOTHING : LpBase
- MESSAGE_VERBOSE : LpBase
- MESSAGE_WARNING : LpBase
- MIN : DimacsDescriptor, LpBase
- MINIMUM_MEAN_CYCLE_CANCELING : CycleCanceling< GR, V, C >

### - n -

- NEAREST : InsertionTsp< CM >
- NO_CYCLE : HowardMmc< GR, CM, TR >
- NONE : DimacsDescriptor
- NORMAL : TimeStamp

### - o -

- ODD : MaxMatching< GR >
- OPTIMAL : CapacityScaling< GR, V, C, TR >, CostScaling< GR, V, C, TR >, CycleCanceling< GR, V, C >, HowardMmc< GR, CM, TR >, LpSolver, MipSolver, NetworkSimplex< GR, V, C >

### - p -

- PARTIAL_AUGMENT : CostScaling< GR, V, C, TR >
- PENALTY_BASED : GrossoLocatelliPullanMc< GR >
- POST_HEAP : BinHeap< PR, IM, CMP >, BinomialHeap< PR, IM, CMP >, BucketHeap< IM, MIN >, Heap< PR, IM, CMP >, DHeap< PR, IM, D, CMP >, FibHeap< PR, IM, CMP >, PairingHeap< PR, IM, CMP >, QuadHeap< PR, IM, CMP >, RadixHeap< IM >, SimpleBucketHeap< IM, MIN >
- PRE_HEAP : BinHeap< PR, IM, CMP >, BinomialHeap< PR, IM, CMP >, BucketHeap< IM, MIN >, Heap< PR, IM, CMP >, DHeap< PR, IM, D, CMP >, FibHeap< PR, IM, CMP >, PairingHeap< PR, IM, CMP >, QuadHeap< PR, IM, CMP >, RadixHeap< IM >, SimpleBucketHeap< IM, MIN >
- PUSH : CostScaling< GR, V, C, TR >

### - r -

- RANDOM : GrossoLocatelliPullanMc< GR >, InsertionTsp< CM >
- REAL : MipSolver

### - s -

- SHORT : TimeStamp
- SIMPLE_CYCLE_CANCELING : CycleCanceling< GR, V, C >
- SIZE_LIMIT : GrossoLocatelliPullanMc< GR >
- SOLVED : LpBase
- SP : DimacsDescriptor
- SQUARE : GraphToEps< T >
- STEP_LIMIT : GrossoLocatelliPullanMc< GR >

### - u -

- UNBOUNDED : CapacityScaling< GR, V, C, TR >, CostScaling< GR, V, C, TR >, CycleCanceling< GR, V, C >, LpSolver, MipSolver, NetworkSimplex< GR, V, C >
- UNDEFINED : LpSolver, MipSolver
- UNKNOWN_OPT : ArgParserException
- UNMATCHED : MaxMatching< GR >
- UNSOLVED : LpBase
- UPPER : LpSolver