- getAncestors(V) - Method in interface berack96.lib.graph.Graph
-
Get all the vertices that have the vertex passed as their child.
Basically is the opposite of
Graph.getChildren(Object)
Note: depending on the implementation, modifying the returned collection
could affect the graph behavior and the changes could be reflected to the graph.
- getAncestors(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getAncestors(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- getAncestors(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- getAncestors() - Method in class berack96.lib.graph.Vertex
-
Get all the vertex ancestor of this vertex.
The ancestors are all the vertices that have as destination this vertex.
- getAncestorsAsVertex() - Method in class berack96.lib.graph.Vertex
-
Get all the ancestors of this vertex like
Vertex.getAncestors(), but as
Vertex.
In this way they are linked to the graph as this one.
This method allocate a new object for each vertex, so it is more heavy.
- getBox(EdgeComponent<V, W>, Point) - Method in class berack96.lib.graph.view.edge.EdgeView
-
- getBox(O, Point) - Method in interface berack96.lib.graph.view.GraphicalView
-
Box where the object is sensible at listeners (like Hitbox)
- getBox(VertexComponent<V>, Point) - Method in class berack96.lib.graph.view.vertex.VertexView
-
- getChildren(V) - Method in interface berack96.lib.graph.Graph
-
Get all the vertices that are children of the vertex passed as parameter.
The vertices V(0-N) that are 'children' of a vertex V1, are all the vertices that have an edge
where V1 is the source of that edge.
Note: depending on the implementation, modifying the returned collection
could affect the graph behavior and the changes could be reflected to the graph.
- getChildren(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getChildren(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- getChildren(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- getChildren() - Method in class berack96.lib.graph.Vertex
-
Get all the vertex children of the current vertex
- getChildrenAsVertex() - Method in class berack96.lib.graph.Vertex
-
Get all the children of this vertex like
Vertex.getChildren(), but as
Vertex.
In this way they are linked to the graph as this one.
* This method allocate a new object for each vertex, so it is more heavy.
- getDescription() - Method in class berack96.lib.graph.view.edge.EdgeListener
-
- getDescription() - Method in interface berack96.lib.graph.view.GraphListener
-
Get the description of this listener, in a way to interact with the user.
- getDescription() - Method in class berack96.lib.graph.view.vertex.VertexListener
-
- getDescription() - Method in class berack96.lib.graph.view.VisitListener
-
- getDestination() - Method in class berack96.lib.graph.Edge
-
The vertex where the edge goes
- getDiscovered() - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
Get all the discovered vertices so far.
- getEdgeAt(Point) - Method in class berack96.lib.graph.view.GraphPanel
-
- getEdgesIn(V) - Method in interface berack96.lib.graph.Graph
-
Retrieve all the edges of a particular vertex.
Note: the edges that are returned are the one that have this vertex as destination and another as source.
Note2: depending on the implementation, modifying the returned collection
could affect the graph behavior and the changes could be reflected to the graph.
- getEdgesIn(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getEdgesIn(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- getEdgesIn(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- getEdgesIn() - Method in class berack96.lib.graph.Vertex
-
Get all the edge that goes INTO this vertex
- getEdgesOut(V) - Method in interface berack96.lib.graph.Graph
-
Retrieve all the edges that goes OUT of a particular vertex.
Note: the edges that are returned are the one that have this vertex as source and another one as destination.
Note2: depending on the implementation, modifying the returned collection
could affect the graph behavior and the changes could be reflected to the graph.
- getEdgesOut(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getEdgesOut(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- getEdgesOut(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- getEdgesOut() - Method in class berack96.lib.graph.Vertex
-
Get all the edge that goes OUT of this vertex
- getGraph() - Method in class berack96.lib.graph.view.GraphPanel
-
- getGraphPanel() - Method in class berack96.lib.graph.view.GraphWindow
-
- getLastDistance() - Method in class berack96.lib.graph.visit.impl.Dijkstra
-
- getLastDistance() - Method in interface berack96.lib.graph.visit.VisitDistance
-
Get the last calculated distance to all the possible destinations
The map contains all the possible vertices that are reachable from the source set in the visit
If there is no path between the destination and the source, then null is returned as accordingly to the map interface
If the visit is not already been done, then the map is null.
- getLastSource() - Method in class berack96.lib.graph.visit.impl.Dijkstra
-
- getLastSource() - Method in interface berack96.lib.graph.visit.VisitDistance
-
Get the last source vertex of the visit for calculating the destinations.
Returns null if the visit is not already been done
- getMarkedWith(Object) - Method in interface berack96.lib.graph.Graph
-
Get all the vertices that are marked with the specific mark passed.
If there aren't vertices with that mark then it is returned an empty set.
Note: depending on the implementation, modifying the returned collection
could affect the graph behavior and the changes could be reflected to the graph.
- getMarkedWith(Object) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getMarkedWith(Object) - Method in class berack96.lib.graph.impl.MapGraph
-
- getMarkedWith(Object) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- getMarks(V) - Method in interface berack96.lib.graph.Graph
-
Get all the marker of this vertex.
If the vertex doesn't have any mark, then it will return an empty set.
Note: depending on the implementation, modifying the returned collection
could affect the graph behavior and the changes could be reflected to the graph.
- getMarks(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getMarks(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- getMarks(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- getMarks() - Method in class berack96.lib.graph.Vertex
-
Get all the marks that are associated with this vertex
- getParentOf(V) - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
Get the parent of a particular vertex.
The parent of a vertex is the one that has discovered it
If the vertex has no parent (it has not been set by the visit algorithm or it's the source) then null is returned.
- getSCC() - Method in class berack96.lib.graph.visit.impl.Tarjan
-
- getSCC() - Method in interface berack96.lib.graph.visit.VisitSCC
-
Return the latest calculated strongly connected components of the graph.
- getSource() - Method in class berack96.lib.graph.Edge
-
The vertex where the edge starts from
- getSource() - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
Get the source of the visit.
- getTimeDiscover(V) - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
The time of the vertex when it is discovered in the visit.
For "discovered" i mean when the node is first found by the visit algorithm.
- getTimeVisit(V) - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
The time when the vertex is visited by the algorithm
For "visited" i mean when the node is finally visited by the visit algorithm.
- getTopologicalSort() - Method in class berack96.lib.graph.visit.impl.Tarjan
-
- getTopologicalSort() - Method in interface berack96.lib.graph.visit.VisitTopological
-
Return the latest calculated Topological sort of the graph.
If the latest visited graph is not a DAG, it will return null.
- getValue() - Method in class berack96.lib.graph.Vertex
-
Get the vertex
- getVertex(V) - Method in interface berack96.lib.graph.Graph
-
Get an instance of the vertex linked with this graph.
For more info see
Vertex
- getVertex(V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getVertex(V) - Method in class berack96.lib.graph.impl.MapGraph
-
- getVertex(V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- getVertexAt(Point) - Method in class berack96.lib.graph.view.GraphPanel
-
- getVisited() - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
Get all the visited vertices so far.
- getWeight() - Method in class berack96.lib.graph.Edge
-
The weight of the edge
- getWeight(V, V) - Method in interface berack96.lib.graph.Graph
-
Get the weight of the selected edge.
If the edge doesn't exist, then null is returned
- getWeight(V, V) - Method in class berack96.lib.graph.impl.AdjGraph
-
- getWeight(V, V) - Method in class berack96.lib.graph.impl.MapGraph
-
- getWeight(V, V) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- Graph<V,W extends java.lang.Number> - Interface in berack96.lib.graph
-
An interface for the graphs.
This interface is used for the graphs with Directed edges.
A directed edge between V1 and V2 is an edge that has V1 as source and V2 as destination.
- GraphicalView<O> - Interface in berack96.lib.graph.view
-
An interface for divide the "hitbox" and the "paint" of the various items
- GraphInfo<V,W extends java.lang.Number> - Class in berack96.lib.graph.view
-
- GraphInfo(GraphPanel<V, W>, VertexListener<V>, EdgeListener<V, W>, Set<VisitStrategy<V, W>>) - Constructor for class berack96.lib.graph.view.GraphInfo
-
- GraphListener - Interface in berack96.lib.graph.view
-
An interface for creating a listener of the Graph.
- GraphPanel<V,W extends java.lang.Number> - Class in berack96.lib.graph.view
-
- GraphPanel(GraphicalView<VertexComponent<V>>, GraphicalView<EdgeComponent<V, W>>, Class<V>, Class<W>) - Constructor for class berack96.lib.graph.view.GraphPanel
-
- GraphSaveStructure - Class in berack96.lib.graph.models
-
Support class used for saving a Graph in a file.
- GraphSaveStructure() - Constructor for class berack96.lib.graph.models.GraphSaveStructure
-
- GraphSaveStructure(Graph<?, ?>, String) - Constructor for class berack96.lib.graph.models.GraphSaveStructure
-
- GraphWindow<V,W extends java.lang.Number> - Class in berack96.lib.graph.view
-
This class is the Window that appear for building the graph and playing around with it
- GraphWindow(GraphPanel<V, W>, VertexListener<V>, EdgeListener<V, W>) - Constructor for class berack96.lib.graph.view.GraphWindow
-
- GSON - Static variable in interface berack96.lib.graph.Graph
-