Package | Description |
---|---|
it.uniupo.drawLib | |
it.uniupo.graphLib | |
it.uniupo.quizLib |
Modifier and Type | Method and Description |
---|---|
void |
DrawGraph.drawNeighbors(int node,
java.lang.Iterable<Edge> nbors) |
Modifier and Type | Method and Description |
---|---|
Edge |
Edge.copy()
Returns a copy of this
|
Edge |
Edge.reverse()
Returns the reverse of this edge (tail and head swapped)
|
Modifier and Type | Method and Description |
---|---|
java.lang.Iterable<Edge> |
GraphInterface.getOutEdges(int u)
Returns the edges incident to node u, as an iterable
|
java.lang.Iterable<Edge> |
Graph.getOutEdges(int u) |
Modifier and Type | Method and Description |
---|---|
void |
GraphInterface.addEdge(Edge e)
Adds to the graph a new edge
|
void |
Graph.addEdge(Edge e) |
int |
Edge.compareTo(Edge otherEdge) |
boolean |
GraphInterface.hasEdge(Edge e)
Whether this graph has the specified edge
|
boolean |
Graph.hasEdge(Edge e) |
Modifier and Type | Method and Description |
---|---|
static Edge |
GraphGen.newRandomEdge(int numberOfNodes,
int edgeWeight)
Returns a random edge not already in the graph
|
Modifier and Type | Method and Description |
---|---|
java.lang.Iterable<Edge> |
ReverseOrderedUndigraph.getOutEdges(int u) |
java.lang.Iterable<Edge> |
ReverseOrderedDigraph.getOutEdges(int u) |
java.lang.Iterable<Edge> |
OrderedGraph.getOutEdges(int u) |
Modifier and Type | Method and Description |
---|---|
int |
ReverseEdgeComparator.compare(Edge firstEdge,
Edge otherEdge) |
boolean |
OrderedUndigraph.hasEdge(Edge e) |
Modifier and Type | Method and Description |
---|---|
static java.lang.String |
QuizUtils.noWeightOrderedEdgesString(java.util.ArrayList<Edge> al) |
static java.lang.String |
QuizUtils.noWeightString(java.util.ArrayList<Edge> al) |