 |
OR-Tools
8.2
|
- a -
- Action : Solver
- AdjacencyList : DenseIntTopologicalSorterTpl< stable_sort >
- allocator_type : StrongVector< IntType, T, Alloc >
- ArcIndex : EbertGraph< NodeIndexType, ArcIndexType >, ForwardEbertGraph< NodeIndexType, ArcIndexType >, ForwardStaticGraph< NodeIndexType, ArcIndexType >, GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, Graphs< Graph >, Graphs< operations_research::StarGraph >, LinearSumAssignment< GraphType >, BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
- ArcIndexArray : GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
- ArcIterator : UndirectedAdjacencyListsOfDirectedGraph< Graph >
- AtMostOne : SccGraph
- b -
- c -
- ClauseIndex : SatPresolver
- CliqueCallback : BronKerboschAlgorithm< NodeIndex >
- Closure : Solver
- const_it : ReverseView< Container >
- const_iterator : StrongVector< IntType, T, Alloc >, DynamicPartition::IterablePart, RevIntSet< T >, RevMap< Map >, SparsePermutation::Iterator, VectorMap< T >, BeginEndWrapper< Iterator >
- const_pointer : StrongVector< IntType, T, Alloc >
- const_reference : StrongVector< IntType, T, Alloc >, VectorMap< T >
- const_reverse_iterator : StrongVector< IntType, T, Alloc >, VectorMap< T >
- ConstIterator : RevisedSimplexDictionary, SortedDisjointIntervalList
- ConstraintIndex : FeasibilityPump, LinearProgrammingConstraint
- CostClassIndex : RoutingModel
- d -
- e -
- g -
- i -
- Implication : SccGraph
- IncomingArcIterator : GenericMaxFlow< Graph >
- Index : ScatteredVectorEntry< IndexType >, SparseVector< IndexType, IteratorType >, SparseVectorEntry< IndexType >, VectorIterator< EntryType >
- IndexEvaluator1 : Solver
- IndexEvaluator2 : Solver
- IndexEvaluator3 : Solver
- IndexFilter1 : Solver
- IndexPair : RoutingModel
- IndexPairs : RoutingModel
- IndexPermutation : SparseVector< IndexType, IteratorType >
- IndexType : StrongVector< IntType, T, Alloc >, StrictITIVector< IntType, T >
- Int64ToIntVar : Solver
- IntContainer : Assignment
- Integer : HamiltonianPathSolver< CostType, CostFunction >, PruningHamiltonianSolver< CostType, CostFunction >
- IntegerType : Set< Integer >, SetRangeIterator< SetRange >
- IntervalContainer : Assignment
- IntervalSet : SortedDisjointIntervalList
- IsArcCallback : BronKerboschAlgorithm< NodeIndex >
- iterator : StrongVector< IntType, T, Alloc >
- Iterator : ColumnView, SparseVector< IndexType, IteratorType >, SortedDisjointIntervalList
- iterator_category : IntegerRangeIterator< IntegerType >, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
- k -
- l -
- m -
- n -
- NodeHeight : GenericMaxFlow< Graph >
- NodeHeightArray : GenericMaxFlow< Graph >
- NodeIndex : EbertGraph< NodeIndexType, ArcIndexType >, ForwardEbertGraph< NodeIndexType, ArcIndexType >, ForwardStaticGraph< NodeIndexType, ArcIndexType >, GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, Graphs< Graph >, Graphs< operations_research::StarGraph >, LinearSumAssignment< GraphType >, RoutingIndexManager, BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
- NodeSet : HamiltonianPathSolver< CostType, CostFunction >, PruningHamiltonianSolver< CostType, CostFunction >
- o -
- p -
- ParentType : StrongVector< IntType, T, Alloc >, StrictITIVector< IntType, T >
- PickupToDeliveryLimitFunction : RoutingDimension
- pointer : StrongVector< IntType, T, Alloc >, STLCountingAllocator< T, Alloc >, VectorMap< T >, IntegerRangeIterator< IntegerType >, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
- r -
- s -
- Saving : SavingsFilteredHeuristic
- SccFinder : SccGraph
- Seed : CheapestInsertionFilteredHeuristic
- SendMethod : LogMessage
- SequenceContainer : Assignment
- Set : ConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, E >, ConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > >, ConnectedComponentsTypeHelper< T, CompareOrHashT >
- SetType : SetRangeIterator< SetRange >, SetRangeWithCardinality< Set >
- size_type : StrongVector< IntType, T, Alloc >, STLCountingAllocator< T, Alloc >, VectorMap< T >
- t -
- v -
- value_type : StrongVector< IntType, T, Alloc >, DynamicPartition::IterablePart, RevMap< Map >, SparsePermutation::Iterator, VectorMap< T >, BeginEndWrapper< Iterator >, IntegerRangeIterator< IntegerType >, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
- ValuedPosition : CheapestInsertionFilteredHeuristic
- ValueType : IntType< IntTypeName, _ValueType >
- VariableIndexEvaluator2 : RoutingModel
- VariableIndexSelector : Solver
- VariableValueComparator : Solver
- VariableValueSelector : Solver
- VehicleClassIndex : RoutingModel
- VisitTypePolicy : TypeRegulationsChecker
- void_function : GoogleInitializer