Loading...
Searching...
No Matches
Here is a list of all documented functions with links to the class documentation for each member:

### - s -

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