- r -

• RadixHeap() : RadixHeap< IM >
• Random() : Random
• RangeIdMap() : RangeIdMap< GR, K >
• rangeIdMap() : RangeIdMap< GR, K >
• rangeMap() : RangeMap< V >
• reach() : BfsVisitor< GR > , DfsVisitor< GR >
• reached() : DfsVisit< GR, VS, TR > , Dijkstra< GR, LEN, TR > , MaxCardinalitySearch< GR, CAP, TR > , MinCostArborescence< GR, CM, TR > , BellmanFord< GR, LEN, TR > , Bfs< GR, TR > , BfsVisit< GR, VS, TR > , Dfs< GR, 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
• reason() : ArgParserException
• red() : BpGraph , BaseBpGraphComponent , Color
• redCrossRef() : BpGraphCopy< From, To >
• RedNode() : BpGraph::RedNode , BaseBpGraphComponent::RedNode
• redNode() : BpGraphCopy< From, To > , FullBpGraph , BpGraphReader< BGR > , BpGraphWriter< BGR > , BpGraph , BaseBpGraphComponent
• RedNodeIt() : BpGraph::RedNodeIt
• RedNodeMap() : BpGraph::RedNodeMap< T > , MappableBpGraphComponent< BAS >::RedNodeMap< V >
• redNodeMap() : BpGraphCopy< From, To > , BpGraphReader< BGR > , BpGraphWriter< BGR >
• redNum() : FullBpGraph
• redRef() : BpGraphCopy< From, To >
• refOption() : ArgParser
• refresh() : ArcLookUp< GR > , AllArcLookUp< GR >
• RefType() : ArgParser::RefType
• replace() : BinHeap< PR, IM, CMP > , DHeap< PR, IM, D, CMP > , QuadHeap< PR, IM, CMP >
• reserveArc() : ListDigraph , SmartDigraph
• reserveEdge() : ListGraph , ListBpGraph , SmartGraph , SmartBpGraph
• reserveNode() : ListDigraph , ListGraph , ListBpGraph , SmartDigraph , SmartGraph , SmartBpGraph
• reset() : CapacityScaling< GR, V, C, TR > , CostScaling< GR, V, C, TR > , Counter , CycleCanceling< GR, V, C > , NetworkSimplex< GR, V, C > , TimeStamp , Timer
• 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() : ResidualDigraph< DGR, CM, FM, TL >::ResidualCapacity
• residualDigraph() : ResidualDigraph< DGR, CM, FM, TL >
• ResidualDigraph() : ResidualDigraph< DGR, CM, FM, TL >
• resize() : Palette , FullDigraph , FullGraph , FullBpGraph , GridGraph , HypercubeGraph
• restart() : Timer
• restore() : ListDigraph::Snapshot , ListGraph::Snapshot , ListBpGraph::Snapshot , SmartDigraph::Snapshot , SmartGraph::Snapshot , SmartBpGraph::Snapshot
• RevArcIt() : PathDumper< GR >::RevArcIt
• reverseArc() : Orienter< GR, DM > , ListDigraph
• reverseDigraph() : ReverseDigraph< DGR >
• ReverseDigraph() : ReverseDigraph< DGR >
• right() : GridGraph , Box< T >
• rootDist() : GomoryHu< GR, CAP >
• rot180() : Point< T >
• rot270() : Point< T >
• rot90() : Point< T >
• row() : GridGraph , LpBase
• Row() : LpBase::Row
• row() : LpBase
• rowByName() : LpBase
• rowFromId() : LpBase
• RowIt() : LpBase::RowIt
• rowLowerBound() : LpBase
• RowMap() : GridGraph::RowMap
• rowMap() : GridGraph
• rowName() : LpBase
• rowStatus() : LpSolver
• rowUpperBound() : LpBase
• run() : DigraphReader< DGR > , Preflow< GR, CAP, TR > , Bfs< GR, TR > , DfsVisit< GR, VS, TR > , BpGraphReader< BGR > , GraphReader< GR > , BfsVisit< GR, VS, TR > , DigraphWriter< DGR > , LgfContents , NetworkSimplex< GR, V, C > , InsertionTsp< CM > , BfsVisit< GR, VS, TR > , PlanarDrawing< Graph > , Dfs< GR, TR > , BpGraphCopy< From, To > , MaxMatching< GR > , SectionWriter , ArgParser , DfsVisit< GR, VS, TR > , MaxWeightedPerfectMatching< GR, WM > , ChristofidesTsp< CM > , Dijkstra< GR, LEN, TR > , DfsWizard< TR > , GreedyTsp< CM > , MinCostArborescence< GR, CM, TR > , Suurballe< GR, LEN, TR > , CycleCanceling< GR, V, C > , GomoryHu< GR, CAP > , DigraphCopy< From, To > , CostScaling< GR, V, C, TR > , NagamochiIbaraki< GR, CM, TR > , NearestNeighborTsp< CM > , DijkstraWizard< TR > , GraphCopy< From, To > , MaxWeightedPerfectFractionalMatching< GR, WM > , MaxWeightedFractionalMatching< GR, WM > , GraphWriter< GR > , MaxCardinalitySearch< GR, CAP, TR > , GrossoLocatelliPullanMc< GR > , Opt2Tsp< CM > , DfsWizard< TR > , BellmanFordWizard< TR > , MaxWeightedMatching< GR, WM > , HartmannOrlinMmc< GR, CM, TR > , DfsVisit< GR, VS, TR > , Opt2Tsp< CM > , BellmanFord< GR, LEN, TR > , BellmanFordWizard< TR > , Bfs< GR, TR > , DfsWizard< TR > , BfsWizard< TR > , Circulation< GR, LM, UM, SM, TR > , BfsVisit< GR, VS, TR > , SectionReader , BfsWizard< TR > , CapacityScaling< GR, V, C, TR > , BfsWizard< TR > , Bfs< GR, TR > , Dfs< GR, TR > , BellmanFord< GR, LEN, TR > , Opt2Tsp< CM > , Dfs< GR, TR > , EdmondsKarp< GR, CAP, TR > , Dijkstra< GR, LEN, TR > , MaxCardinalitySearch< GR, CAP, TR > , PlanarDrawing< Graph > , PlanarEmbedding< Graph > , HaoOrlin< GR, CAP, TOL > , GraphToEps< T > , KarpMmc< GR, CM, TR > , BpGraphWriter< BGR > , HowardMmc< GR, CM, TR > , MaxFractionalMatching< GR, TR > , DijkstraWizard< TR >
• runFiveColoring() : PlanarColoring< Graph >
• runMinCut() : Preflow< GR, CAP, TR >
• running() : Timer
• runningNode() : Digraph , IterableDigraphComponent< BAS > , BpGraph , Graph , IterableDigraphComponent< BAS > , BpGraph , IterableGraphComponent< BAS > , Graph , BpGraph , Graph , Digraph
• runPerfect() : MaxFractionalMatching< GR, TR >
• runSixColoring() : PlanarColoring< Graph >