- RADIUS - Static variable in class it.uniupo.drawLib.DrawGraph
-
- RAGGIO_PUNTINO_VUOTO - Static variable in class it.uniupo.drawLib.DrawGraph
-
- readFileToString(String) - Static method in class it.uniupo.graphLib.InOut
-
Reads the whole file to a string; lines are separated by \n prints an
error message to StdOut in case of I/O error
- readString(String) - Static method in class it.uniupo.graphLib.InOut
-
Reads the first line of a file to a string, prints an error message to
StdOut in case of I/O error
- readStringArray(String) - Static method in class it.uniupo.graphLib.InOut
-
Reads the whole file to an array of strings: one string per line prints
an error message to StdOut in case of I/O error
- RED - Static variable in class it.uniupo.drawLib.StdDraw
-
- removeBackEdgesDirected(GraphInterface) - Static method in class it.uniupo.quizLib.QuizUtils
-
- removeEdge(int, int) - Method in class it.uniupo.graphLib.DirectedGraph
-
- removeEdge(int, int) - Method in class it.uniupo.graphLib.Graph
-
- removeEdge(int, int) - Method in interface it.uniupo.graphLib.GraphInterface
-
Removes the specified edge from the graph (if the egde exists)
- removeEdge(int, int) - Method in class it.uniupo.graphLib.UndirectedGraph
-
- removeEdge(int, int) - Method in class it.uniupo.quizLib.OrderedDigraph
-
- removeEdge(int, int) - Method in class it.uniupo.quizLib.OrderedUndigraph
-
- removeEdge(int, int) - Method in class it.uniupo.quizLib.ReverseOrderedDigraph
-
- removeEdge(int, int) - Method in class it.uniupo.quizLib.ReverseOrderedUndigraph
-
- reverse() - Method in class it.uniupo.graphLib.Edge
-
Returns the reverse of this edge (tail and head swapped)
- ReverseEdgeComparator - Class in it.uniupo.quizLib
-
- ReverseEdgeComparator() - Constructor for class it.uniupo.quizLib.ReverseEdgeComparator
-
- reverseGraph(DirectedGraph) - Static method in class it.uniupo.graphLib.GraphUtils
-
Reverses the input graph
- ReverseOrderedDigraph - Class in it.uniupo.quizLib
-
- ReverseOrderedDigraph(int) - Constructor for class it.uniupo.quizLib.ReverseOrderedDigraph
-
- ReverseOrderedDigraph(String) - Constructor for class it.uniupo.quizLib.ReverseOrderedDigraph
-
- ReverseOrderedDigraph(GraphInterface) - Constructor for class it.uniupo.quizLib.ReverseOrderedDigraph
-
- reverseOrderedDigraphGen(int, boolean, boolean, double, double) - Static method in class it.uniupo.quizLib.OrderedGraphGen
-
Returns a random "ordered directed graph" on numberOfNodes vertices and a random number of edges
(number of nodes/2 \leq number of edges \lt numberOfNodes*numberOfNodes*density)
- ReverseOrderedUndigraph - Class in it.uniupo.quizLib
-
- ReverseOrderedUndigraph(int) - Constructor for class it.uniupo.quizLib.ReverseOrderedUndigraph
-
- ReverseOrderedUndigraph(String) - Constructor for class it.uniupo.quizLib.ReverseOrderedUndigraph
-
- ReverseOrderedUndigraph(GraphInterface) - Constructor for class it.uniupo.quizLib.ReverseOrderedUndigraph
-
- reverseOrderedUndigraphGen(int, boolean, boolean, double, double) - Static method in class it.uniupo.quizLib.OrderedGraphGen
-
Returns a random "ordered directed graph" on numberOfNodes vertices and a random number of edges
(number of nodes/2 \leq number of edges \lt numberOfNodes*numberOfNodes*density)
- reverseSort(GraphInterface) - Static method in class it.uniupo.quizLib.QuizUtils
-
If the input graph is an UndirectedGraph, it returns a ReverseOrderedUndigraph;
if it is a DirectedGraph, it returns an ReverseOrderedDigraph
- risposta(String) - Static method in class it.uniupo.quizLib.QuizUtils
-
- rispostaAperta(String) - Static method in class it.uniupo.quizLib.QuizUtils
-
- rootedOutDAG(int, int, int, int, int, boolean) - Static method in class it.uniupo.quizLib.GraphGen
-
Returns a random rooted-out DAG on numNodes vertices and numEdges edges.
- rootedOutDagGen(int, int) - Static method in class it.uniupo.quizLib.GraphGen
-
Returns a random rooted-out DAG on numberOfNodes vertices and a random number of edges
(number of nodes \leq number of edges \lt 3/2 number of nodes), with non negative weights
A rooted out-tree is a DAG in which every vertex is reachable from a
single vertex.
- rootedOutDagGen(int, int, boolean, boolean) - Static method in class it.uniupo.quizLib.GraphGen
-
Returns a random rooted-out DAG on numberOfNodes vertices and a random number of edges
(number of nodes \leq number of edges \lt 3/2 number of nodes), with weights as specified by the
parameters
A rooted out-tree is a DAG in which every vertex is reachable from a
single vertex.
- rootedOutDagGen(int, int, int, int, int, boolean) - Static method in class it.uniupo.quizLib.GraphGen
-
Returns a random rooted-out DAG on numberOfNodes vertices and a specified number of edges
(if the specified number is not positive, 1 is substituted; if it is \gt numberOfNodes*(numberOfNodes-1) / 2,
the maximum is substituted), with weights as specified by the
parameters
A rooted out-tree is a DAG in which every vertex is reachable from a
single vertex.