C++ Reference
C++ Reference: Algorithms
- a -
- AddMappings() : DynamicPermutation
- AddToCurrentCycle() : SparsePermutation
- AllMappingsSrc() : DynamicPermutation
- assignment() : KnapsackSearchNode
- b -
- BaseKnapsackSolver() : BaseKnapsackSolver
- begin() : DynamicPartition::IterablePart , SparsePermutation::Iterator
- best_solution() : BaseKnapsackSolver , KnapsackGenericSolver
- BestSolutionContains() : KnapsackSolver
- c -
- CloseCurrentCycle() : SparsePermutation
- ComputeProfitBounds() : KnapsackCapacityPropagator , KnapsackPropagator
- CopyCurrentStateToSolution() : KnapsackPropagator
- CopyCurrentStateToSolutionPropagator() : KnapsackCapacityPropagator , KnapsackPropagator
- CreateSparsePermutation() : DynamicPermutation
- current_profit() : KnapsackPropagator , KnapsackSearchNode
- Cycle() : SparsePermutation
- d -
- DebugString() : DynamicPartition , DynamicPermutation , MergingPartition , SparsePermutation
- DenseDoublyLinkedList() : DenseDoublyLinkedList
- depth() : KnapsackSearchNode
- DistinguishNodeInPartition() : GraphSymmetryFinder
- DynamicPartition() : DynamicPartition
- DynamicPermutation() : DynamicPermutation
- e -
- ElementsInHierarchicalOrder() : DynamicPartition
- ElementsInPart() : DynamicPartition
- ElementsInSamePartAs() : DynamicPartition
- end() : DynamicPartition::IterablePart , SparsePermutation::Iterator
- f -
- FillEquivalenceClasses() : MergingPartition
- FindSymmetries() : GraphSymmetryFinder
- FprintOfPart() : DynamicPartition
- from() : KnapsackSearchPath
- g -
- GetEfficiency() : KnapsackItem
- GetLowerAndUpperBoundWhenItem() : BaseKnapsackSolver , KnapsackGenericSolver
- GetName() : BaseKnapsackSolver , KnapsackSolver
- GetNextItemId() : KnapsackCapacityPropagator , KnapsackPropagator
- GetNumberOfItems() : KnapsackGenericSolver , KnapsackState
- GetRoot() : MergingPartition
- GetRootAndCompressPath() : MergingPartition
- GraphSymmetryFinder() : GraphSymmetryFinder
- i -
- ImageOf() : DynamicPermutation
- Init() : BaseKnapsackSolver , KnapsackGenericSolver , KnapsackPropagator , KnapsackSearchPath , KnapsackSolver , KnapsackState
- InitPropagator() : KnapsackCapacityPropagator , KnapsackPropagator
- is_bound() : KnapsackState
- is_in() : KnapsackState
- IsGraphAutomorphism() : GraphSymmetryFinder
- IsSolutionOptimal() : KnapsackSolver
- items() : KnapsackPropagator
- IterablePart() : DynamicPartition::IterablePart
- Iterator() : SparsePermutation::Iterator
- k -
- KeepOnlyOneNodePerPart() : MergingPartition
- KnapsackAssignment() : KnapsackAssignment
- KnapsackCapacityPropagator() : KnapsackCapacityPropagator
- KnapsackGenericSolver() : KnapsackGenericSolver
- KnapsackItem() : KnapsackItem
- KnapsackPropagator() : KnapsackPropagator
- KnapsackSearchNode() : KnapsackSearchNode
- KnapsackSearchPath() : KnapsackSearchPath
- KnapsackSolver() : KnapsackSolver
- KnapsackState() : KnapsackState
- l -
- LastElementInCycle() : SparsePermutation
- LooseEnds() : DynamicPermutation
- m -
- MergePartsOf() : MergingPartition
- MergingPartition() : MergingPartition
- MoveUpToDepth() : KnapsackSearchPath
- n -
- Next() : DenseDoublyLinkedList
- next_item_id() : KnapsackSearchNode
- NumCycles() : SparsePermutation
- NumElements() : DynamicPartition
- NumNodes() : MergingPartition
- NumNodesInSamePartAs() : MergingPartition
- NumParts() : DynamicPartition
- p -
- parent() : KnapsackSearchNode
- ParentOfPart() : DynamicPartition
- PartOf() : DynamicPartition
- Prev() : DenseDoublyLinkedList
- profit_lower_bound() : KnapsackPropagator
- profit_upper_bound() : KnapsackPropagator , KnapsackSearchNode
- r -
- RecursivelyRefinePartitionByAdjacency() : GraphSymmetryFinder
- Refine() : DynamicPartition
- Remove() : DenseDoublyLinkedList
- RemoveCycles() : SparsePermutation
- Reset() : DynamicPermutation , MergingPartition
- ResetNode() : MergingPartition
- RootOf() : DynamicPermutation
- s -
- set_current_profit() : KnapsackSearchNode
- set_master_propagator_id() : KnapsackGenericSolver
- set_next_item_id() : KnapsackSearchNode
- set_profit_lower_bound() : KnapsackPropagator
- set_profit_upper_bound() : KnapsackPropagator , KnapsackSearchNode
- set_time_limit() : KnapsackSolver
- set_use_reduction() : KnapsackSolver
- Size() : DenseDoublyLinkedList
- size() : DynamicPartition::IterablePart
- Size() : DynamicPermutation
- size() : SparsePermutation::Iterator
- Size() : SparsePermutation
- SizeOfPart() : DynamicPartition
- Solve() : BaseKnapsackSolver , KnapsackGenericSolver , KnapsackSolver
- SparsePermutation() : SparsePermutation
- state() : KnapsackPropagator
- Support() : SparsePermutation
- t -
- to() : KnapsackSearchPath
- u -
- UndoLastMappings() : DynamicPermutation
- UndoRefineUntilNumPartsEqual() : DynamicPartition
- Update() : KnapsackPropagator
- UpdatePropagator() : KnapsackCapacityPropagator , KnapsackPropagator
- UpdateState() : KnapsackState
- use_reduction() : KnapsackSolver
- v -
- via() : KnapsackSearchPath
- ~ -
- ~BaseKnapsackSolver() : BaseKnapsackSolver
- ~KnapsackCapacityPropagator() : KnapsackCapacityPropagator
- ~KnapsackGenericSolver() : KnapsackGenericSolver
- ~KnapsackPropagator() : KnapsackPropagator
- ~KnapsackSolver() : KnapsackSolver