- r -

• RadixHeap() : RadixHeap< IM >
• Random() : Random
• RangeIdMap() : RangeIdMap< GR, K >
• rangeMap() : RangeMap< V >
• RangeMap() : RangeMap< V >
• rangeMap() : RangeMap< V >
• reach() : BfsVisitor< GR > , DfsVisitor< GR >
• reached() : Dfs< GR, TR > , DfsVisit< GR, VS, TR > , Dijkstra< GR, LEN, TR > , MinCostArborescence< GR, CM, TR > , Bfs< GR, TR > , BfsVisit< GR, VS, TR >
• reachedMap() : Bfs< GR, TR > , BfsWizard< TR > , BfsVisit< GR, VS, TR > , Dfs< GR, TR > , DfsWizard< TR > , DfsVisit< GR, VS, TR >
• real() : Random
• realTime() : TimeStamp , Timer
• red() : Color
• refOption() : ArgParser
• refresh() : ArcLookUp< GR > , AllArcLookUp< GR >
• RefType() : ArgParser::RefType
• remove() : RadixHeap< IM >
• replace() : BinHeap< PR, IM, CMP >
• reserveArc() : ListDigraph , SmartDigraph
• reserveNode() : ListDigraph , SmartDigraph
• reset() : Counter , NetworkSimplex< GR, V, C > , TimeStamp , Timer
• 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() : Palette , FullDigraph , FullGraph , GridGraph , RangeMap< V >
• restart() : Timer
• restore() : SmartGraph::Snapshot , ListDigraph::Snapshot , ListGraph::Snapshot , SmartDigraph::Snapshot
• RevArcIt() : PathDumper< GR >::RevArcIt
• reverseArc() : Orienter< GR, DM > , ListDigraph
• ReverseDigraph() : ReverseDigraph< DGR >
• reverseDigraph() : ReverseDigraph< DGR >
• 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() : GridGraph::RowMap
• rowName() : LpBase
• rowStatus() : LpSolver
• rowUpperBound() : LpBase
• run() : BfsWizard< TR > , GraphReader< GR > , DigraphReader< DGR > , DigraphCopy< From, To > , DfsVisit< GR, VS, TR > , Suurballe< GR, LEN > , Bfs< GR, TR > , Dijkstra< GR, LEN, TR > , HaoOrlin< GR, CAP, TOL > , MaxWeightedPerfectMatching< GR, WM > , DijkstraWizard< TR > , BfsVisit< GR, VS, TR > , Dfs< GR, TR > , MaxMatching< GR > , DfsWizard< TR > , Dfs< GR, TR > , DfsVisit< GR, VS, TR > , MaxWeightedMatching< GR, WM > , DfsWizard< TR > , Dijkstra< GR, LEN, TR > , BfsVisit< GR, VS, TR > , NetworkSimplex< GR, V, C > , GomoryHu< GR, CAP > , GraphWriter< GR > , Preflow< GR, CAP, TR > , SectionWriter , Dfs< GR, TR > , Bfs< GR, TR > , BfsWizard< TR > , BfsVisit< GR, VS, TR > , BfsWizard< TR > , LgfContents , Circulation< GR, LM, UM, SM, TR > , SectionReader , MinCostArborescence< GR, CM, TR > , GraphToEps< T > , HaoOrlin< GR, CAP, TOL > , DfsWizard< TR > , ArgParser , DigraphWriter< DGR > , DijkstraWizard< TR > , Bfs< GR, TR > , GraphCopy< From, To >
• runMinCut() : Preflow< GR, CAP, TR >
• running() : Timer
• runningNode() : IterableDigraphComponent< BAS > , Graph , Digraph , Graph , IterableDigraphComponent< BAS > , Digraph , IterableGraphComponent< BAS >