Here is a list of all documented class members with links to the class documentation for each member:
- o -
- obj() : LpBase
- objCoeff() : LpBase
- ODD : MaxMatching< GR >
- onLevel() : Elevator< GR, Item >, LinkedElevator< GR, Item >
- onlyOneGroup() : ArgParser
- OperationTraits : BellmanFord< GR, LEN, TR >, BellmanFordDefaultTraits< GR, LEN >, BellmanFordWizardDefaultTraits< GR, LEN >, Dijkstra< GR, LEN, TR >, DijkstraDefaultTraits< GR, LEN >, DijkstraWizardDefaultTraits< GR, LEN >
- operator Arc() : Path< GR >::ArcIt, PathDumper< GR >::ArcIt, PathDumper< GR >::RevArcIt, DiEulerIt< GR >, EulerIt< GR >
- operator bool() : ArgParser::RefType
- operator Col() : LpBase::Expr::CoeffIt, LpBase::Expr::ConstCoeffIt
- operator const Arc &() : ListPath< GR >::ArcIt, Path< GR >::ArcIt, SimplePath< GR >::ArcIt, StaticPath< GR >::ArcIt
- operator const Item &() : ExtendFindEnum< IM >::ItemIt, HeapUnionFind< V, IM, Comp >::ItemIt, UnionFindEnum< IM >::ItemIt
- operator double() : ArgParser::RefType
- operator Edge() : BpGraph::Arc, Graph::Arc, EulerIt< GR >
- operator int() : ArgParser::RefType, Counter, ExtendFindEnum< IM >::ClassIt, UnionFindEnum< IM >::ClassIt
- operator Node() : BellmanFord< GR, LEN, TR >::ActiveIt, GrossoLocatelliPullanMc< GR >::CliqueNodeIt, MaxWeightedMatching< GR, WM >::BlossomIt, MaxWeightedPerfectMatching< GR, WM >::BlossomIt, MinCostArborescence< GR, CM, TR >::DualIt, PathNodeIt< Path >
- operator Row() : LpBase::DualExpr::CoeffIt, LpBase::DualExpr::ConstCoeffIt
- operator std::string() : ArgParser::RefType
- operator TimeStamp() : Timer
- operator typename Graph::Arc() : GomoryHu< GR, CAP >::MinCutEdgeIt
- operator typename Graph::Edge() : GomoryHu< GR, CAP >::MinCutEdgeIt
- operator typename Graph::Node() : GomoryHu< GR, CAP >::MinCutNodeIt
- operator!=() : BpGraph::Arc, BpGraph::Edge, BpGraph::Node, Digraph::Arc, Digraph::Node, Graph::Arc, Graph::Edge, Graph::Node, GraphIncIt< GR, Item, Base, sel >, GraphItem, GraphItemIt< GR, Item >, Path< GR >::ArcIt, PathDumper< GR >::ArcIt, PathDumper< GR >::RevArcIt, CrossRefMap< GR, K, V >::ValueIt, DiEulerIt< GR >, Point< T >, EulerIt< GR >, ExtendFindEnum< IM >::ClassIt, ExtendFindEnum< IM >::ItemIt, HeapUnionFind< V, IM, Comp >::ClassIt, HeapUnionFind< V, IM, Comp >::ItemIt, IterableValueMap< GR, K, V >::ValueIt, ListPath< GR >::ArcIt, LpBase::Col, LpBase::DualExpr::CoeffIt, LpBase::DualExpr::ConstCoeffIt, LpBase::Expr::CoeffIt, LpBase::Expr::ConstCoeffIt, LpBase::Row, MaxWeightedMatching< GR, WM >::BlossomIt, MaxWeightedPerfectMatching< GR, WM >::BlossomIt, MinCostArborescence< GR, CM, TR >::DualIt, Path< GR >::ArcIt, PathNodeIt< Path >, SimplePath< GR >::ArcIt, StaticPath< GR >::ArcIt, UnionFindEnum< IM >::ClassIt, UnionFindEnum< IM >::ItemIt
- operator&() : Box< T >
- operator()() : AllArcLookUp< GR >, ArcLookUp< GR >, CrossRefMap< GR, K, V >, DynArcLookUp< GR >, FullDigraph, FullGraph, GridGraph, HypercubeGraph, IdMap< GR, K >, MapToFunctor< M >, Random, RangeIdMap< GR, K >
- operator*() : CrossRefMap< GR, K, V >::ValueIt, Point< T >, IterableValueMap< GR, K, V >::ValueIt, LpBase::DualExpr::CoeffIt, LpBase::DualExpr::ConstCoeffIt, LpBase::DualExpr, LpBase::Expr::CoeffIt, LpBase::Expr::ConstCoeffIt, LpBase::Expr, TimeStamp
- operator*=() : Point< T >, LpBase::DualExpr, LpBase::Expr, TimeStamp
- operator+() : Point< T >, LpBase::DualExpr, LpBase::Expr, TimeStamp
- operator++() : BellmanFord< GR, LEN, TR >::ActiveIt, ConArcIt< GR >, BpGraph::ArcIt, BpGraph::BlueNodeIt, BpGraph::EdgeIt, BpGraph::InArcIt, BpGraph::IncEdgeIt, BpGraph::NodeIt, BpGraph::OutArcIt, BpGraph::RedNodeIt, Digraph::ArcIt, Digraph::InArcIt, Digraph::NodeIt, Digraph::OutArcIt, Graph::ArcIt, Graph::EdgeIt, Graph::InArcIt, Graph::IncEdgeIt, Graph::NodeIt, Graph::OutArcIt, GraphIncIt< GR, Item, Base, sel >, GraphItemIt< GR, Item >, Path< GR >::ArcIt, PathDumper< GR >::ArcIt, PathDumper< GR >::RevArcIt, ConEdgeIt< GR >, Counter, CrossRefMap< GR, K, V >::ValueIt, DiEulerIt< GR >, EulerIt< GR >, ExtendFindEnum< IM >::ClassIt, ExtendFindEnum< IM >::ItemIt, GomoryHu< GR, CAP >::MinCutEdgeIt, GomoryHu< GR, CAP >::MinCutNodeIt, GrossoLocatelliPullanMc< GR >::CliqueNodeIt, HeapUnionFind< V, IM, Comp >::ItemIt, IterableBoolMap< GR, K >::FalseIt, IterableBoolMap< GR, K >::ItemIt, IterableBoolMap< GR, K >::TrueIt, IterableIntMap< GR, K >::ItemIt, IterableValueMap< GR, K, V >::ItemIt, IterableValueMap< GR, K, V >::ValueIt, ListPath< GR >::ArcIt, LpBase::ColIt, LpBase::DualExpr::CoeffIt, LpBase::DualExpr::ConstCoeffIt, LpBase::Expr::CoeffIt, LpBase::Expr::ConstCoeffIt, LpBase::RowIt, MaxWeightedMatching< GR, WM >::BlossomIt, MaxWeightedPerfectMatching< GR, WM >::BlossomIt, MinCostArborescence< GR, CM, TR >::DualIt, Path< GR >::ArcIt, PathNodeIt< Path >, SimplePath< GR >::ArcIt, StaticPath< GR >::ArcIt, UnionFindEnum< IM >::ClassIt, UnionFindEnum< IM >::ItemIt
- operator+=() : Counter, Point< T >, LpBase::DualExpr, LpBase::Expr, TimeStamp
- operator-() : Point< T >, LpBase::DualExpr, LpBase::Expr, TimeStamp
- operator--() : Counter
- operator-=() : Counter, Point< T >, LpBase::DualExpr, LpBase::Expr, TimeStamp
- operator->() : CrossRefMap< GR, K, V >::ValueIt, IterableValueMap< GR, K, V >::ValueIt
- operator/() : Point< T >, LpBase::DualExpr, LpBase::Expr, TimeStamp
- operator/=() : Point< T >, LpBase::DualExpr, LpBase::Expr, TimeStamp
- operator<() : BpGraph::Arc, BpGraph::Edge, BpGraph::Node, Digraph::Arc, Digraph::Node, Graph::Arc, Graph::Edge, Graph::Node, GraphItem, Path< GR >::ArcIt, PathDumper< GR >::ArcIt, PathDumper< GR >::RevArcIt, ListPath< GR >::ArcIt, LpBase::Col, LpBase::Row, Path< GR >::ArcIt, PathNodeIt< Path >, SimplePath< GR >::ArcIt, StaticPath< GR >::ArcIt
- operator<<() : Box< T >, Point< T >, TimeStamp
- operator<=() : LpBase::Constr
- operator=() : BpGraph::ArcMap< T >, BpGraph::BlueNodeMap< T >, BpGraph::EdgeMap< T >, BpGraph::NodeMap< T >, BpGraph, BpGraph::RedNodeMap< T >, Digraph::ArcMap< T >, Digraph::NodeMap< T >, Digraph, Graph::ArcMap< T >, Graph::EdgeMap< T >, Graph::NodeMap< T >, Graph, GraphIncIt< GR, Item, Base, sel >, GraphItem, GraphItemIt< GR, Item >, GraphMap< GR, K, V >, MappableBpGraphComponent< BAS >::BlueNodeMap< V >, MappableBpGraphComponent< BAS >::RedNodeMap< V >, MappableDigraphComponent< BAS >::ArcMap< V >, MappableDigraphComponent< BAS >::NodeMap< V >, MappableGraphComponent< BAS >::EdgeMap< V >, Path< GR >, CplexEnv, ListBpGraph, ListDigraph, ListGraph, ListPath< GR >, Path< GR >, Random, SimplePath< GR >, SmartBpGraph, SmartDigraph, SmartGraph, StaticPath< GR >
- operator==() : BpGraph::Arc, BpGraph::Edge, BpGraph::Node, Digraph::Arc, Digraph::Node, Graph::Arc, Graph::Edge, Graph::Node, GraphIncIt< GR, Item, Base, sel >, GraphItem, GraphItemIt< GR, Item >, Path< GR >::ArcIt, PathDumper< GR >::ArcIt, PathDumper< GR >::RevArcIt, CrossRefMap< GR, K, V >::ValueIt, DiEulerIt< GR >, Point< T >, EulerIt< GR >, ExtendFindEnum< IM >::ClassIt, ExtendFindEnum< IM >::ItemIt, HeapUnionFind< V, IM, Comp >::ClassIt, HeapUnionFind< V, IM, Comp >::ItemIt, IterableValueMap< GR, K, V >::ValueIt, ListPath< GR >::ArcIt, LpBase::Col, LpBase::Constr, LpBase::DualExpr::CoeffIt, LpBase::DualExpr::ConstCoeffIt, LpBase::Expr::CoeffIt, LpBase::Expr::ConstCoeffIt, LpBase::Row, MaxWeightedMatching< GR, WM >::BlossomIt, MaxWeightedPerfectMatching< GR, WM >::BlossomIt, MinCostArborescence< GR, CM, TR >::DualIt, Path< GR >::ArcIt, PathNodeIt< Path >, SimplePath< GR >::ArcIt, StaticPath< GR >::ArcIt, UnionFindEnum< IM >::ClassIt, UnionFindEnum< IM >::ItemIt
- operator>=() : LpBase::Constr
- operator>>() : Box< T >, Point< T >
- operator[]() : AbsMap< M >, AddMap< M1, M2 >, AndMap< M1, M2 >, ArgParser, BackwardMap< GR >, BinHeap< PR, IM, CMP >, BinomialHeap< PR, IM, CMP >, BucketHeap< IM, MIN >, CombineMap< M1, M2, F, V >, ComposeMap< M1, M2 >, Heap< PR, IM, CMP >, ReadMap< K, T >, ReadWriteMap< K, T >, ReferenceMap< K, T, R, CR >, ConstMap< K, V >, ConstMap< K, Const< V, v > >, ConvertMap< M, V >, CrossRefMap< GR, K, V >::InverseMap, CrossRefMap< GR, K, V >, DHeap< PR, IM, D, CMP >, Point< T >, DivMap< M1, M2 >, Elevator< GR, Item >, EqualMap< M1, M2 >, FalseMap< K >, FibHeap< PR, IM, CMP >, ForkMap< M1, M2 >, ForwardMap< GR >, FunctorToMap< F, K, V >, GridGraph::ColMap, GridGraph::IndexMap, GridGraph::RowMap, HeapUnionFind< V, IM, Comp >, HypercubeGraph::HyperMap< T, BF >, IdentityMap< T >, IdMap< GR, K >::InverseMap, IdMap< GR, K >, InDegMap< GR >, IterableBoolMap< GR, K >, IterableIntMap< GR, K >, IterableValueMap< GR, K, V >, LessMap< M1, M2 >, LinkedElevator< GR, Item >, LpBase::DualExpr, LpBase::Expr, MapToFunctor< M >, MulMap< M1, M2 >, NegMap< M >, NegWriteMap< M >, NotMap< M >, NotWriteMap< M >, NullMap< K, V >, OrMap< M1, M2 >, OutDegMap< GR >, PairingHeap< PR, IM, CMP >, Palette, PlanarDrawing< Graph >, PotentialDifferenceMap< GR, POT >, QuadHeap< PR, IM, CMP >, RadixHeap< IM >, Random, RangeIdMap< GR, K >::InverseMap, RangeIdMap< GR, K >, RangeMap< V >, ResidualDigraph< DGR, CM, FM, TL >::ResidualCapacity, ScaleMap< M, C >, ScaleWriteMap< M, C >, ShiftMap< M, C >, ShiftWriteMap< M, C >, SimpleBucketHeap< IM, MIN >, SourceMap< GR >, SparseMap< K, V, Comp >, SplitNodes< DGR >::CombinedArcMap< AM, NM >, SplitNodes< DGR >::CombinedNodeMap< IN, OUT >, SubMap< M1, M2 >, TargetMap< GR >, TrueMap< K >, Undirector< DGR >::CombinedArcMap< FW, BK >
- oppositeArc() : BaseGraphComponent, BpGraph, Graph
- oppositeNode() : BaseDigraphComponent, BpGraph, Digraph, Graph
- Opt2Tsp() : Opt2Tsp< CM >
- 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 >
- optionGroup() : ArgParser
- Orienter() : Orienter< GR, DM >
- orienter() : Orienter< GR, DM >
- origArc() : SplitNodes< DGR >
- OrMap() : OrMap< M1, M2 >
- orMap() : OrMap< M1, M2 >
- ostream() : BpGraphWriter< BGR >, DigraphWriter< DGR >, GraphWriter< GR >, SectionWriter
- other() : ArgParser
- OutArcIt() : BpGraph::OutArcIt, Digraph::OutArcIt, Graph::OutArcIt, IterableDigraphComponent< BAS >
- OutDegMap() : OutDegMap< GR >
- outNode() : SplitNodes< DGR >