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

- s -

• save() : ListDigraph::Snapshot , ListGraph::Snapshot , SmartDigraph::Snapshot , SmartGraph::Snapshot , ListBpGraph::Snapshot , SmartBpGraph::Snapshot
• scale() : GraphToEps< T >
• scaleMap() : ScaleMap< M, C >
• ScaleMap() : ScaleMap< M, C >
• scaleToA4() : GraphToEps< T >
• ScaleWriteMap() : ScaleWriteMap< M, C >
• scaleWriteMap() : ScaleWriteMap< M, C >
• sectionLines() : SectionReader , SectionWriter
• sectionReader() : SectionReader
• SectionReader() : SectionReader
• sectionReader() : SectionReader
• sectionStream() : SectionReader , SectionWriter
• sectionWriter() : SectionWriter
• SectionWriter() : SectionWriter
• seed() : Random
• seedFromFile() : Random
• seedFromTime() : Random
• SelectionRule : GrossoLocatelliPullanMc< GR > , InsertionTsp< CM >
• Sense : LpBase
• sense() : LpBase
• set() : IterableIntMap< GR, K > , IterableValueMap< GR, K, V > , PairingHeap< PR, IM, CMP > , QuadHeap< PR, IM, CMP > , RadixHeap< IM > , HeapUnionFind< V, IM, Comp > , Heap< PR, IM, CMP > , WriteMap< K, T > , ReadWriteMap< K, T > , ReferenceMap< K, T, R, CR > , Undirector< DGR >::CombinedArcMap< FW, BK > , SplitNodes< DGR >::CombinedNodeMap< IN, OUT > , SplitNodes< DGR >::CombinedArcMap< AM, NM > , BinHeap< PR, IM, CMP > , BinomialHeap< PR, IM, CMP > , BucketHeap< IM, MIN > , Color , Palette , DHeap< PR, IM, D, CMP > , FibHeap< PR, IM, CMP > , LpBase::Expr , LpBase::DualExpr , NullMap< K, V > , ConstMap< K, V > , ConstMap< K, Const< V, v > > , RangeMap< V > , SparseMap< K, V, Comp > , ForkMap< M1, M2 > , ShiftWriteMap< M, C > , ScaleWriteMap< M, C > , NegWriteMap< M > , NotWriteMap< M > , LoggerBoolMap< IT, KEY > , CrossRefMap< GR, K, V > , IterableBoolMap< GR, K >
• setAll() : ConstMap< K, V > , SparseMap< K, V, Comp > , IterableBoolMap< GR, K >
• shiftMap() : ShiftMap< M, C >
• ShiftMap() : ShiftMap< M, C >
• shiftWriteMap() : ShiftWriteMap< M, C >
• ShiftWriteMap() : ShiftWriteMap< M, C >
• SHORT : TimeStamp
• SIMPLE_CYCLE_CANCELING : CycleCanceling< GR, V, C >
• SimpleBucketHeap() : SimpleBucketHeap< IM, MIN >
• SimplePath() : SimplePath< GR >
• simplify() : LpBase::Expr , LpBase::DualExpr
• size() : BinHeap< PR, IM, CMP > , BinomialHeap< PR, IM, CMP > , BucketHeap< IM, MIN > , SimpleBucketHeap< IM, MIN > , Palette , DHeap< PR, IM, D, CMP > , Point< T > , FibHeap< PR, IM, CMP > , RangeMap< V > , RangeIdMap< GR, K > , RangeIdMap< GR, K >::InverseMap , IterableIntMap< GR, K > , PairingHeap< PR, IM, CMP > , QuadHeap< PR, IM, CMP > , RadixHeap< IM > , UnionFind< IM > , UnionFindEnum< IM > , Heap< PR, IM, CMP >
• SIZE_LIMIT : GrossoLocatelliPullanMc< GR >
• sizeLimit() : GrossoLocatelliPullanMc< GR >
• skipArcs() : DigraphReader< DGR > , DigraphWriter< DGR >
• skipEdges() : GraphReader< GR > , BpGraphReader< BGR > , GraphWriter< GR > , BpGraphWriter< BGR >
• skipNodes() : DigraphReader< DGR > , GraphReader< GR > , BpGraphReader< BGR > , DigraphWriter< DGR > , GraphWriter< GR > , BpGraphWriter< BGR >
• SmartArcSet() : SmartArcSet< GR >
• SmartBpGraph() : SmartBpGraph
• SmartDigraph() : SmartDigraph
• SmartEdgeSet() : SmartEdgeSet< GR >
• SmartGraph() : SmartGraph
• Snapshot() : ListDigraph::Snapshot , ListGraph::Snapshot , ListBpGraph::Snapshot , SmartDigraph::Snapshot , SmartGraph::Snapshot , SmartBpGraph::Snapshot
• sol() : MipSolver
• solValue() : MipSolver
• solve() : LpSolver , MipSolver
• solveBarrier() : ClpLp , CplexLp
• SOLVED : LpBase
• solveDual() : ClpLp , CplexLp , GlpkLp
• SolveExitStatus : LpBase
• solvePrimal() : ClpLp , CplexLp , GlpkLp
• solverName() : LpBase
• SoplexLp() : SoplexLp
• source() : EdmondsKarp< GR, CAP, TR > , Preflow< GR, CAP, TR > , BpGraph , Digraph , Graph , BaseDigraphComponent
• SourceMap() : SourceMap< GR >
• sourceMap() : SourceMap< GR >
• SP : DimacsDescriptor
• SparseMap() : SparseMap< K, V, Comp >
• sparseMap() : SparseMap< K, V, Comp >
• splice() : ListPath< GR >
• spliceBack() : ListPath< GR >
• spliceFront() : ListPath< GR >
• split() : ListDigraph , ListPath< GR > , SmartDigraph , UnionFindEnum< IM > , HeapUnionFind< V, IM, Comp >
• splitNodes() : SplitNodes< DGR >
• SplitNodes() : SplitNodes< DGR >
• SQUARE : GraphToEps< T >
• stamp() : TimeStamp
• start() : MaxCardinalitySearch< GR, CAP, TR > , MinCostArborescence< GR, CM, TR > , Suurballe< GR, LEN, TR > , Bfs< GR, TR > , DfsVisitor< GR > , MaxCardinalitySearch< GR, CAP, TR > , BfsVisit< GR, VS, TR > , Dfs< GR, TR > , DfsVisit< GR, VS, TR > , MaxFractionalMatching< GR, TR > , MaxCardinalitySearch< GR, CAP, TR > , DfsVisit< GR, VS, TR > , Dijkstra< GR, LEN, TR > , MaxWeightedPerfectMatching< GR, WM > , MaxWeightedFractionalMatching< GR, WM > , MaxWeightedPerfectFractionalMatching< GR, WM > , MaxWeightedMatching< GR, WM > , EdmondsKarp< GR, CAP, TR > , NagamochiIbaraki< GR, CM, TR > , Timer , Dijkstra< GR, LEN, TR > , Circulation< GR, LM, UM, SM, TR > , BfsVisitor< GR > , BellmanFord< GR, LEN, TR >
• startAugment() : CostScaling< GR, V, C, TR >
• startDense() : MaxMatching< GR >
• startFirstPhase() : Preflow< GR, CAP, TR >
• startPerfect() : MaxFractionalMatching< GR, TR >
• startPush() : CostScaling< GR, V, C, TR >
• startSecondPhase() : Preflow< GR, CAP, TR >
• startSparse() : MaxMatching< GR >
• state() : PairingHeap< PR, IM, CMP > , Heap< PR, IM, CMP >
• State : FibHeap< PR, IM, CMP > , BinomialHeap< PR, IM, CMP >
• state() : Heap< PR, IM, CMP >
• State : DHeap< PR, IM, D, CMP > , QuadHeap< PR, IM, CMP >
• state() : RadixHeap< IM >
• State : Heap< PR, IM, CMP > , RadixHeap< IM > , SimpleBucketHeap< IM, MIN >
• state() : SimpleBucketHeap< IM, MIN > , BucketHeap< IM, MIN > , QuadHeap< PR, IM, CMP > , BinomialHeap< PR, IM, CMP >
• State : BinHeap< PR, IM, CMP >
• state() : QuadHeap< PR, IM, CMP > , FibHeap< PR, IM, CMP > , RadixHeap< IM >
• State : BucketHeap< IM, MIN >
• state() : BinHeap< PR, IM, CMP > , FibHeap< PR, IM, CMP >
• State : PairingHeap< PR, IM, CMP >
• state() : DHeap< PR, IM, D, CMP > , BinHeap< PR, IM, CMP > , BinomialHeap< PR, IM, CMP > , DHeap< PR, IM, D, CMP > , PairingHeap< PR, IM, CMP >
• StaticDigraph() : StaticDigraph
• StaticPath() : StaticPath< GR >
• status() : SubDigraph< DGR, NF, AF > , FilterArcs< DGR, AF > , SubGraph< GR, NF, EF > , FilterNodes< GR, NF > , SubGraph< GR, NF, EF > , FilterEdges< GR, EF > , FilterNodes< GR, NF > , SubDigraph< DGR, NF, AF > , MaxMatching< GR > , SubDigraph< DGR, NF, AF >
• Status : MaxMatching< GR >
• status() : SubGraph< GR, NF, EF > , FilterArcs< DGR, AF > , SubDigraph< DGR, NF, AF > , SubGraph< GR, NF, EF >
• StatusMap : MaxMatching< GR >
• statusMap() : MaxMatching< GR >
• STEP_LIMIT : GrossoLocatelliPullanMc< GR >
• stepLimit() : GrossoLocatelliPullanMc< GR >
• stop() : DfsVisitor< GR > , Timer
• stringOption() : ArgParser
• stSupply() : CycleCanceling< GR, V, C > , NetworkSimplex< GR, V, C > , CapacityScaling< GR, V, C, TR > , CostScaling< GR, V, C, TR >
• SubCounter : Counter
• SubDigraph() : SubDigraph< DGR, NF, AF >
• subDigraph() : SubDigraph< DGR, NF, AF >
• SubGraph() : SubGraph< GR, NF, EF >
• subGraph() : SubGraph< GR, NF, EF >
• SubMap() : SubMap< M1, M2 >
• subMap() : SubMap< M1, M2 >
• supplyMap() : CostScaling< GR, V, C, TR >
• SupplyMap : Circulation< GR, LM, UM, SM, TR >
• supplyMap() : NetworkSimplex< GR, V, C > , CycleCanceling< GR, V, C >
• SupplyMap : CirculationDefaultTraits< GR, LM, UM, SM >
• supplyMap() : Circulation< GR, LM, UM, SM, TR > , CapacityScaling< GR, V, C, TR >
• supplyType() : NetworkSimplex< GR, V, C >
• SupplyType : NetworkSimplex< GR, V, C >
• Suurballe() : Suurballe< GR, LEN, TR >
• swap() : RangeIdMap< GR, K >
• synonym() : ArgParser
• systemTime() : TimeStamp , Timer