Skip navigation links
A B C D E F G H I K L M N O P R S T U V W 

A

addAllEdges(Collection<Edge<V, W>>) - Method in interface berack96.lib.graph.Graph
Add all the edges of the collection to the graph.
If one of the two, or both vertices aren't contained in the graph, then the vertices will be added.
Any null edges will be ignored.
This method will overwrite any existing edge between the two vertex.
addAllEdges(Collection<Edge<V, W>>) - Method in class berack96.lib.graph.impl.AdjGraph
 
addAllEdges(Collection<Edge<V, W>>) - Method in class berack96.lib.graph.impl.MapGraph
 
addAllEdges(Collection<Edge<V, W>>) - Method in class berack96.lib.graph.impl.MatrixGraph
 
addAllVertices(Collection<V>) - Method in interface berack96.lib.graph.Graph
Add all the vertices contained in the collection to the graph.
If a vertex is contained in the collection and in the graph is ignored and it will not be replaced.
Null vertices will be ignored and they will not be added to the graph.
addAllVertices(Collection<V>) - Method in class berack96.lib.graph.impl.AdjGraph
 
addAllVertices(Collection<V>) - Method in class berack96.lib.graph.impl.MapGraph
 
addAllVertices(Collection<V>) - Method in class berack96.lib.graph.impl.MatrixGraph
 
addChild(V, Number) - Method in class berack96.lib.graph.Vertex
Add a child to this vertex.
The added child must be in the graph or it will return an exception.
addEdge(V, V, W) - Method in interface berack96.lib.graph.Graph
Add an edge between the two vertex.
The edge will be created from the vertex V1 and the vertex V2
This method will overwrite any existing edge between the two vertex.
If there was a previous edge then it is returned
addEdge(Edge<V, W>) - Method in interface berack96.lib.graph.Graph
Add an edge between the two vertex.
The edge will be created from the vertex source of the edge and the vertex destination of it
This method will overwrite any existing edge between the two vertex.
If there was a previous edge then it is returned
addEdge(V, V, W) - Method in class berack96.lib.graph.impl.AdjGraph
 
addEdge(Edge<V, W>) - Method in class berack96.lib.graph.impl.AdjGraph
 
addEdge(V, V, W) - Method in class berack96.lib.graph.impl.MapGraph
 
addEdge(Edge<V, W>) - Method in class berack96.lib.graph.impl.MapGraph
 
addEdge(V, V, W) - Method in class berack96.lib.graph.impl.MatrixGraph
 
addEdge(Edge<V, W>) - Method in class berack96.lib.graph.impl.MatrixGraph
 
addEdge(Edge<V, W>) - Method in class berack96.lib.graph.view.GraphPanel
 
addEdge(VertexComponent<V>, VertexComponent<V>, W) - Method in class berack96.lib.graph.view.GraphPanel
 
addEdgeAndVertices(V, V, W) - Method in interface berack96.lib.graph.Graph
This particular function add an edge to the graph.
If one of the two, or both vertices aren't contained in the graph, then the vertices will be added.
The edge will be created from the vertex V1 and the vertex V2
This method will overwrite any existing edge between the two vertex.
If there was a previous edge then it is returned
addEdgeAndVertices(Edge<V, W>) - Method in interface berack96.lib.graph.Graph
This particular function add an edge to the graph.
If one of the two, or both vertices of the edge aren't contained in the graph, then the vertices will be added.
The edge will be created from the vertex source of the edge and the vertex destination of it
This method will overwrite any existing edge between the two vertex.
If there was a previous edge then it is returned
addEdgeAndVertices(V, V, W) - Method in class berack96.lib.graph.impl.AdjGraph
 
addEdgeAndVertices(Edge<V, W>) - Method in class berack96.lib.graph.impl.AdjGraph
 
addEdgeAndVertices(V, V, W) - Method in class berack96.lib.graph.impl.MapGraph
 
addEdgeAndVertices(Edge<V, W>) - Method in class berack96.lib.graph.impl.MapGraph
 
addEdgeAndVertices(V, V, W) - Method in class berack96.lib.graph.impl.MatrixGraph
 
addEdgeAndVertices(Edge<V, W>) - Method in class berack96.lib.graph.impl.MatrixGraph
 
addIfAbsent() - Method in class berack96.lib.graph.Vertex
Add the vertex to the graph only if it's not already in the graph.
addObserver(Observer) - Method in class berack96.lib.graph.view.GraphPanel
 
addVertex(V) - Method in interface berack96.lib.graph.Graph
Add the vertex to the graph.
addVertex(V) - Method in class berack96.lib.graph.impl.AdjGraph
 
addVertex(V) - Method in class berack96.lib.graph.impl.MapGraph
 
addVertex(V) - Method in class berack96.lib.graph.impl.MatrixGraph
 
addVertex(Point, V) - Method in class berack96.lib.graph.view.GraphPanel
 
addVertexIfAbsent(V) - Method in interface berack96.lib.graph.Graph
Add the specified vertex to the graph only if the graph doesn't contains it.
The graph contains a vertex only if the method Graph.contains(Object) returns true.
addVertexIfAbsent(V) - Method in class berack96.lib.graph.impl.AdjGraph
 
addVertexIfAbsent(V) - Method in class berack96.lib.graph.impl.MapGraph
 
addVertexIfAbsent(V) - Method in class berack96.lib.graph.impl.MatrixGraph
 
AdjGraph<V,W extends java.lang.Number> - Class in berack96.lib.graph.impl
 
AdjGraph() - Constructor for class berack96.lib.graph.impl.AdjGraph
 
Arrow - Class in berack96.lib.graph.view.stuff
Class that create a Polygon that has a shape of an arrow
Arrow(Point, Point, int, int) - Constructor for class berack96.lib.graph.view.stuff.Arrow
Create an arrow
A B C D E F G H I K L M N O P R S T U V W 
Skip navigation links