- vert - Variable in class berack96.lib.graph.models.MarkSaveStructure
-
- Vertex<V> - Class in berack96.lib.graph
-
Class used for represent a vertex of the graph.
The vertex contained is linked with the graph, so if any changes are made to
it, then they will be reflected here.
- Vertex(Graph<V, ?>, V) - Constructor for class berack96.lib.graph.Vertex
-
Get a Vertex linked with the graph
- vertex - Variable in class berack96.lib.graph.view.vertex.VertexComponent
-
- vertex - Variable in class berack96.lib.graph.visit.impl.VisitInfo.VertexInfo
-
- VERTEX_NOT_CONTAINED - Static variable in interface berack96.lib.graph.Graph
-
- VertexComponent<V> - Class in berack96.lib.graph.view.vertex
-
- VertexComponent(Vertex<V>) - Constructor for class berack96.lib.graph.view.vertex.VertexComponent
-
- VertexIntListener - Class in berack96.lib.graph.view.vertex
-
- VertexIntListener(GraphPanel<Integer, ?>) - Constructor for class berack96.lib.graph.view.vertex.VertexIntListener
-
- VertexListener<V> - Class in berack96.lib.graph.view.vertex
-
- VertexListener(GraphPanel<V, ?>) - Constructor for class berack96.lib.graph.view.vertex.VertexListener
-
- VertexView<V> - Class in berack96.lib.graph.view.vertex
-
- VertexView() - Constructor for class berack96.lib.graph.view.vertex.VertexView
-
- vertices() - Method in interface berack96.lib.graph.Graph
-
Get all the vertices in the graph.
If the graph doesn't contains vertices, it'll return an empty collection.
Note: depending on the implementation, modifying the returned collection
could affect the graph behavior and the changes could be reflected to the graph.
- vertices() - Method in class berack96.lib.graph.impl.AdjGraph
-
- vertices() - Method in class berack96.lib.graph.impl.MapGraph
-
- vertices() - Method in class berack96.lib.graph.impl.MatrixGraph
-
- vertices - Variable in class berack96.lib.graph.models.GraphSaveStructure
-
- visit(V, VisitStrategy<V, W>, Consumer<V>) - Method in interface berack96.lib.graph.Graph
-
Visit the graph accordingly to the strategy that is passed.
This method visit the graph from the source to all the vertex that are reachable form the source.
Some strategy can accept a source vertex null, because they visit all the graph anyway.
- visit(V, VisitStrategy<V, W>, Consumer<V>) - Method in class berack96.lib.graph.impl.AdjGraph
-
- visit(V, VisitStrategy<V, W>, Consumer<V>) - Method in class berack96.lib.graph.impl.MapGraph
-
- visit(V, VisitStrategy<V, W>, Consumer<V>) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- visit(VisitStrategy, Consumer<V>) - Method in class berack96.lib.graph.Vertex
-
Visit the graph from this current vertex with the strategy assigned
- visit(Graph<V, W>, V, Consumer<V>) - Method in class berack96.lib.graph.visit.impl.BFS
-
- visit(Graph<V, W>, V, Consumer<V>) - Method in class berack96.lib.graph.visit.impl.DFS
-
- visit(Graph<V, W>, V, Consumer<V>) - Method in class berack96.lib.graph.visit.impl.Dijkstra
-
- visit(Graph<V, W>, V, Consumer<V>) - Method in class berack96.lib.graph.visit.impl.Tarjan
-
This particular visit strategy use only the graph and the visit, so the source param is not needed.
- visit(Graph<V, W>, V, Consumer<V>) - Method in interface berack96.lib.graph.visit.VisitStrategy
-
With this the graph will be visited accordingly to the strategy of the visit.
Some strategy can accept a source vertex null, because they visit all the graph anyway.
If you want to stop the visit of the graph, you just have to throw any exception in the visit function, but be sure to catch it
- VisitDistance<V,W extends java.lang.Number> - Interface in berack96.lib.graph.visit
-
Interface that is helpful for implements visit that needs to retrieve the distance between a vertex to all the others
- VisitDistSourceDest<V,W extends java.lang.Number> - Interface in berack96.lib.graph.visit
-
Interface that is helpful for implements visit that needs to retrieve the distance between a vertex to all the others
- VisitInfo<V> - Class in berack96.lib.graph.visit.impl
-
The class used for getting the info of the visit.
It could be used with the algorithm of the visit for set some useful data.
- VisitInfo(V) - Constructor for class berack96.lib.graph.visit.impl.VisitInfo
-
Need a source for initialize the basic values
- VisitInfo.VertexInfo - Class in berack96.lib.graph.visit.impl
-
Class used mainly for storing the data of the visit
- VisitListener<V> - Class in berack96.lib.graph.view
-
- VisitListener(GraphPanel<V, ?>, VisitStrategy<V, ?>) - Constructor for class berack96.lib.graph.view.VisitListener
-
- visitRefresh(int) - Method in class berack96.lib.graph.view.GraphWindow
-
- VisitSCC<V,W extends java.lang.Number> - Interface in berack96.lib.graph.visit
-
Interface that is helpful for implements visit that needs to retrieve the SCC
- VisitStrategy<V,W extends java.lang.Number> - Interface in berack96.lib.graph.visit
-
This class is used for define some strategy for the visit of a graph.
- VisitTopological<V,W extends java.lang.Number> - Interface in berack96.lib.graph.visit
-
Interface that is helpful for implements visit that needs to retrieve the topological sort