- degree(V) - Method in interface berack96.lib.graph.Graph
-
Tells the degree of a vertex.
The degree of a vertex is the quantity of edges that have.
Basically, it'll count how many edge it have.
- degree(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- degree(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- degree(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- degreeIn(V) - Method in interface berack96.lib.graph.Graph
-
Tells the degree of all the edges that goes to this vertex.
Basically, it'll count how many edge towards himself it have.
- degreeIn(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- degreeIn(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- degreeIn(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- degreeOut(V) - Method in interface berack96.lib.graph.Graph
-
Tells the degree of all the edges that goes form this vertex to others.
Basically, it'll count how many edge towards any other vertex it have.
- degreeOut(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- degreeOut(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- degreeOut(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- dest - Variable in class berack96.lib.graph.models.EdgeSaveStructure
-
- destination - Variable in class berack96.lib.graph.view.edge.EdgeComponent
-
- DFS<V,W extends java.lang.Number> - Class in berack96.lib.graph.visit.impl
-
Depth-first search
The algorithm starts at the root node and explores as far as possible along each branch before backtracking.
- DFS() - Constructor for class berack96.lib.graph.visit.impl.DFS
-
- Dijkstra<V,W extends java.lang.Number> - Class in berack96.lib.graph.visit.impl
-
Class that implements the Dijkstra algorithm and uses it for getting all the distance from a source
- Dijkstra() - Constructor for class berack96.lib.graph.visit.impl.Dijkstra
-
- distance(V, V) - Method in interface berack96.lib.graph.Graph
-
Get the minimum path from the source vertex to the destination vertex.
If the source vertex can't reach the destination, then an exception is thrown.
- distance(V) - Method in interface berack96.lib.graph.Graph
-
Get the minimum path from the source vertex to all the possible reachable vertices.
- distance(V, V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- distance(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- distance(V, V) - Method in class berack96.lib.graph.impl.MapGraph
-
- distance(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- distance(V, V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- distance(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- distance(Graph<V, W>, V, V) - Method in interface berack96.lib.graph.visit.VisitDistSourceDest
-
Get the distance from the source to the destination
The list contains the minimum path from the vertex marked as source to the destination vertex