Here is a list of all documented class members with links to the class documentation for each member:

- i -

• id() : AlterationNotifier< _Container, _Item > , IDableGraphComponent< _Base > , IDableUGraphComponent< _Base > , IDableGraphComponent< _Base >
• identityMap() : IdentityMap< T >
• IdMap() : IdMap< _Graph, _Item >
• improveEvent() : SimpleController , ControllerBase
• IN_HEAP : FibHeap< _Prio, _ItemIntMap, _Compare >
• IncEdgeIt() : IncEdgeIt , FredmanTarjan< GR, CM, TR > , IncEdgeIt , Prim< GR, CM, TR > , IncEdgeIt , IterableUGraphComponent< _Base > , IncEdgeIt
• incir : PetStruct< Graph > , UPetStruct< Graph >
• increase() : BinHeap< _Prio, _ItemIntMap, _Compare > , BucketHeap< _ItemIntMap, minimize > , FibHeap< _Prio, _ItemIntMap, _Compare > , RadixHeap< _ItemIntMap > , HeapUnionFind< _Value, _ItemIntMap, _Comp > , Heap< Prio, ItemIntMap >
• InDegMap() : InDegMap< _Graph >
• index() : FullGraph , FullUGraph , HyperCubeGraph
• IndexMap : PlanarColoring< UGraph > , IndexMap
• InEdgeIt : IterableGraphComponent< _Base > , InEdgeIt
• INF : LpSolverBase
• INFEASIBLE : LpSolverBase
• INFINITE : LpSolverBase
• infinity() : BellmanFordDefaultOperationTraits< Value, has_infinity > , DagShortestPathDefaultOperationTraits< Value, has_infinity > , DagLongestPathOperationTraits< Value, has_infinity > , FloydWarshallDefaultOperationTraits< Value, has_infinity > , JohnsonDefaultOperationTraits< Value, has_infinity >
• init() : MaxBipartiteMatching< BpUGraph > , MaxWeightedBipartiteMatching< _BpUGraph, _WeightMap, _Traits > , MinCostMaxBipartiteMatching< _BpUGraph, _CostMap, _Traits > , CancelAndTighten< Graph, LowerMap, CapacityMap, CostMap, SupplyMap > , CapacityScaling< Graph, LowerMap, CapacityMap, CostMap, SupplyMap > , Circulation< _Graph, _LCapMap, _UCapMap, _DeltaMap, _Traits > , CostScaling< Graph, LowerMap, CapacityMap, CostMap, SupplyMap > , CycleCanceling< Graph, LowerMap, CapacityMap, CostMap, SupplyMap > , DagShortestPath< _Graph, _LengthMap, _Traits > , Dfs< GR, TR > , DfsVisit< _Graph, _Visitor, _Traits > , Dijkstra< GR, LM, TR > , DinitzSleatorTarjan< _Graph, _CapacityMap, _Traits > , EdmondsKarp< _Graph, _CapacityMap, _Traits > , ErrorMessage , FloydWarshall< _Graph, _LengthMap, _Traits > , FredmanTarjan< GR, CM, TR > , GoldbergTarjan< _Graph, _CapacityMap, _Traits > , GomoryHuTree< _UGraph, _Capacity > , HaoOrlin< _Graph, _CapacityMap, _Tolerance > , Johnson< _Graph, _LengthMap, _Traits > , Kruskal< _UGraph, _CostMap, _Traits > , MaxMatching< Graph > , MaxWeightedMatching< _UGraph, _WeightMap > , MaxWeightedPerfectMatching< _UGraph, _WeightMap > , MinCostArborescence< _Graph, _CostMap, _Traits > , MinMeanCycle< Graph, LengthMap > , MaxCardinalitySearch< _Graph, _CapacityMap, _Traits > , NagamochiIbaraki< _Graph, _CapacityMap, _Traits > , PrBipartiteMatching< Graph > , Preflow< _Graph, _CapacityMap, _Traits > , SteinerTree< UGraph, CostMap > , Prim< GR, CM, TR > , ControllerBase , SimAnnBase , SimAnn , AdvancedController , Suurballe< Graph, LengthMap > , TabuSearch< GRAPH, VALUE, POLICY, TRAITS > , BellmanFord< _Graph, _LengthMap, _Traits > , Bfs< GR, TR > , BfsVisit< _Graph, _Visitor, _Traits >
• init_ann_fact : AdvancedController
• initAddItem() : Elevator< Graph, Item > , LinkedElevator< Graph, Item >
• initFinish() : Elevator< Graph, Item > , LinkedElevator< Graph, Item >
• initNewLevel() : Elevator< Graph, Item > , LinkedElevator< Graph, Item >
• initPresorted() : Kruskal< _UGraph, _CostMap, _Traits >
• initStart() : LinkedElevator< Graph, Item > , Elevator< Graph, Item >
• inner : PetStruct< Graph > , UPetStruct< Graph >
• inNode() : SplitGraphAdaptorBase< _Graph >
• insert() : UnionFindEnum< _ItemIntMap > , ExtendFindEnum< _ItemIntMap > , RadixHeap< _ItemIntMap > , UnionFind< _ItemIntMap > , UnionFindEnum< _ItemIntMap > , ExtendFindEnum< _ItemIntMap > , HeapUnionFind< _Value, _ItemIntMap, _Comp >
• InserterBoolMap() : InserterBoolMap< Container, Functor >
• InsertReader() : InsertReader< _Container, _ItemReader >
• inside() : BoundingBox< T >
• INT : MipSolverBase
• integer() : MipSolverBase , Random
• integerMap() : IntegerMap< T >
• IntegerMap() : IntegerMap< T >
• integrate() : Polynomial< T >
• integrateMyself() : Polynomial< T >
• intOption() : ArgParser
• inverse() : IdMap< _Graph, _Item > , InvertableMap< _Graph, _Item, _Value > , DescriptorMap< _Graph, _Item >
• InverseMap() : InverseMap
• InvertableMap() : InvertableMap< _Graph, _Item, _Value >
• isBasicCol() : LpSolverBase
• isLabelReader() : UGraphReader< _Graph, _ReaderTraits > , NodeSetReader< _Graph, _Traits > , BpNodeSetReader< _Graph, _Traits > , EdgeSetReader< _Graph, _Traits > , UEdgeSetReader< _Graph, _Traits > , GraphReader< _Graph, _ReaderTraits > , BpUGraphReader< _Graph, _ReaderTraits >
• isLabelWriter() : GraphWriter< _Graph, _WriterTraits > , BpNodeSetWriter< _Graph, _Traits > , NodeSetWriter< _Graph, _Traits > , UEdgeSetWriter< _Graph, _Traits > , UGraphWriter< _Graph, _WriterTraits > , EdgeSetWriter< _Graph, _Traits > , BpUGraphWriter< _Graph, _WriterTraits >
• isMax() : LpSolverBase
• isMin() : LpSolverBase
• item() : ExtendFindEnum< _ItemIntMap >
• Item : DynamicTree< _Value, _ItemIntMap, _Tolerance, _enableSize > , Heap< Prio, ItemIntMap > , DebugMap< _Graph, _Item, _Value >
• item() : UnionFindEnum< _ItemIntMap >
• Item : ArrayMap< _Graph, _Item, _Value > , VectorMap< _Graph, _Item, _Value > , BinHeap< _Prio, _ItemIntMap, _Compare > , BucketHeap< _ItemIntMap, minimize >
• ItemIntMap : BinHeap< _Prio, _ItemIntMap, _Compare > , BucketHeap< _ItemIntMap, minimize > , DynamicTree< _Value, _ItemIntMap, _Tolerance, _enableSize >
• ItemIt() : ItemIt
• iter : SimAnnBase
• IterableBoolMap() : IterableBoolMap< _Graph, _Item >
• IterableIntMap() : IterableIntMap< _Graph, _Item >
• IterableValueMap() : IterableValueMap< _Graph, _Item, _Value >