Here is a list of all documented class members with links to the class documentation for each member:
- r -
- RadixHeap() : RadixHeap< IM >
- RANDOM : GrossoLocatelliPullanMc< GR >, InsertionTsp< CM >
- Random() : Random< Word >
- RangeIdMap() : RangeIdMap< GR , K >
- rangeIdMap() : RangeIdMap< GR , K >
- RangeMap() : RangeMap< V >
- rangeMap() : RangeMap< V >
- RANKING : KBestExtremeFlows< GR , V , C >
- reach() : BfsVisitor< GR >, DfsVisitor< GR >
- reached() : BellmanFord< GR , LEN , TR >, Bfs< GR , TR >, BfsVisit< GR , VS , TR >, Dfs< GR , TR >, DfsVisit< GR , VS , TR >, Dijkstra< GR , LEN , TR >, MaxCardinalitySearch< GR , CAP , TR >, MinCostArborescence< GR , CM , TR >
- ReachedMap : Bfs< GR , TR >, BfsDefaultTraits< GR >, BfsVisit< GR , VS , TR >, BfsVisitDefaultTraits< GR >, BfsWizardDefaultTraits< GR >, Dfs< GR , TR >, DfsDefaultTraits< GR >, DfsVisit< GR , VS , TR >, DfsVisitDefaultTraits< GR >, DfsWizardDefaultTraits< GR >
- reachedMap() : Bfs< GR , TR >, BfsVisit< GR , VS , TR >, BfsWizard< TR >, Dfs< GR , TR >, DfsVisit< GR , VS , TR >, DfsWizard< TR >
- REAL : MipSolver
- real() : Random< Word >
- realTime() : Timer, TimeStamp
- Reason : ArgParserException
- reason() : ArgParserException
- red() : Color, BaseBpGraphComponent, BpGraph
- redCrossRef() : BpGraphCopy< From , To >
- RedNode() : BaseBpGraphComponent::RedNode, BpGraph::RedNode
- redNode() : BpGraphCopy< From , To >, BpGraphReader< BGR >, BpGraphWriter< BGR >, BaseBpGraphComponent, BpGraph, FullBpGraph
- RedNodeIt() : BpGraph::RedNodeIt, IterableBpGraphComponent< BAS >
- RedNodeMap() : BpGraph::RedNodeMap< T >, MappableBpGraphComponent< BAS >::RedNodeMap< V >
- redNodeMap() : BpGraphCopy< From , To >, BpGraphReader< BGR >, BpGraphWriter< BGR >
- RedNodeNotifier : AlterableBpGraphComponent< BAS >
- redNodes() : BpGraph
- redNum() : FullBpGraph
- redRef() : BpGraphCopy< From , To >
- Reference : GraphMap< GR , K , V >, ReferenceMap< K , T , R , CR >, RangeMap< V >, SparseMap< K , V , Comp >
- ReferenceMapTag : ReferenceMap< K , T , R , CR >, IterableBoolMap< GR , K >, IterableIntMap< GR , K >
- refOption() : ArgParser
- refresh() : AllArcLookUp< GR >, ArcLookUp< GR >
- RefType() : ArgParser::RefType
- replace() : BinHeap< PR , IM , CMP >, DHeap< PR , IM , D , CMP >, QuadHeap< PR , IM , CMP >
- reserveArc() : ListDigraph, SmartDigraph
- reserveEdge() : ListBpGraph, ListGraph, SmartBpGraph, SmartGraph
- reserveNode() : ListBpGraph, ListDigraph, ListGraph, SmartBpGraph, SmartDigraph, SmartGraph
- reset() : CapacityScaling< GR , V , C , TR >, CostScaling< GR , V , C , TR >, Counter, CycleCanceling< GR , V , C >, NetworkSimplex< GR , V , C >, Timer, TimeStamp
- resetParams() : CapacityScaling< GR , V , C , TR >, CostScaling< GR , V , C , TR >, CycleCanceling< GR , V , C >, NetworkSimplex< GR , V , C >
- ResidualCapacity() : ResidualDigraph< DGR , CM , FM , TL >::ResidualCapacity
- residualCapacity() : ResidualDigraph< DGR , CM , FM , TL >
- ResidualDigraph() : ResidualDigraph< DGR , CM , FM , TL >
- residualDigraph() : ResidualDigraph< DGR , CM , FM , TL >
- resize() : FullBpGraph, FullDigraph, FullGraph, GridGraph, HypercubeGraph, Palette, RangeMap< V >
- restart() : Timer
- restore() : ListBpGraph::Snapshot, ListDigraph::Snapshot, ListGraph::Snapshot, SmartBpGraph::Snapshot, SmartDigraph::Snapshot, SmartGraph::Snapshot
- RevArcIt() : PathDumper< GR >::RevArcIt
- revArcs() : PathDumper< GR >
- reverseArc() : ListDigraph, Orienter< GR , DM >
- ReverseDigraph() : ReverseDigraph< DGR >
- reverseDigraph() : ReverseDigraph< DGR >
- RevPathTag : PathDumper< GR >
- right() : Box< T >, GridGraph
- rootDist() : GomoryHu< GR , CAP >
- rot180() : Point< T >
- rot270() : Point< T >
- rot90() : Point< T >
- Row() : LpBase::Row
- row() : GridGraph, LpBase
- rowByName() : LpBase
- rowFromId() : LpBase
- RowIt() : LpBase::RowIt
- rowLowerBound() : LpBase
- RowMap() : GridGraph::RowMap
- rowMap() : GridGraph
- rowName() : LpBase
- rows() : LpBase
- rowStatus() : LpSolver
- rowUpperBound() : LpBase
- run() : ArgParser, AStar< GR , LEN , HM , TR >, BellmanFord< GR , LEN , TR >, BellmanFordWizard< TR >, Bfs< GR , TR >, BfsVisit< GR , VS , TR >, BfsWizard< TR >, BidirDijkstra< GR , LEN , TR >, BpGraphCopy< From , To >, BpGraphReader< BGR >, BpGraphWriter< BGR >, CapacityScaling< GR , V , C , TR >, ChristofidesTsp< CM >, Circulation< GR , LM , UM , SM , TR >, CostScaling< GR , V , C , TR >, CycleCanceling< GR , V , C >, Dfs< GR , TR >, DfsVisit< GR , VS , TR >, DfsWizard< TR >, DigraphCopy< From , To >, DigraphReader< DGR >, DigraphWriter< DGR >, Dijkstra< GR , LEN , TR >, DijkstraWizard< TR >, EdmondsKarp< GR , CAP , TR >, GomoryHu< GR , CAP >, GraphCopy< From , To >, GraphReader< GR >, GraphToEps< T >, GraphWriter< GR >, GreedyTsp< CM >, GrossoLocatelliPullanMc< GR >, HaoOrlin< GR , CAP , TOL >, HartmannOrlinMmc< GR , CM , TR >, HopcroftKarp< BPGR >, HowardMmc< GR , CM , TR >, InsertionTsp< CM >, KarpMmc< GR , CM , TR >, KBestExtremeFlows< GR , V , C >, KBestFlows< GR , V , C >, LgfContents, MaxCardinalitySearch< GR , CAP , TR >, MaxFractionalMatching< GR , TR >, MaxMatching< GR >, MaxWeightedFractionalMatching< GR , WM >, MaxWeightedMatching< GR , WM >, MaxWeightedPerfectFractionalMatching< GR , WM >, MaxWeightedPerfectMatching< GR , WM >, MinCostArborescence< GR , CM , TR >, MinCostAssignment< BPGR , CM >, NagamochiIbaraki< GR , CM , TR >, NearestNeighborTsp< CM >, NetworkSimplex< GR , V , C >, Opt2Tsp< CM >, PlanarDrawing< Graph >, PlanarEmbedding< Graph >, Preflow< GR , CAP , TR >, SectionReader, SectionWriter, Suurballe< GR , LEN , TR >, TomitaSekiMc< GR >, Vf2ppWizard< TR >, Vf2Wizard< TR >
- runFiveColoring() : PlanarColoring< Graph >
- runMinCut() : Preflow< GR , CAP , TR >
- running() : Timer
- runningNode() : BpGraph, Digraph, Graph, IterableDigraphComponent< BAS >, IterableGraphComponent< BAS >
- runPerfect() : MaxFractionalMatching< GR , TR >
- runPotentials() : KBestExtremeFlows< GR , V , C >
- runSixColoring() : PlanarColoring< Graph >