V- the graph vertex type
E- the graph edge type
public class ParanoidGraph<V,E> extends GraphDelegator<V,E>
|Constructor and Description|
Create a new paranoid graph.
|Modifier and Type||Method and Description|
Adds the specified edge to this graph, going from the source vertex to the target vertex.
Adds the specified vertex to this graph if not already present.
addEdge, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeWeight, toString, vertexSet
assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toStringFromSets
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
e, to this graph if this graph contains no edge
e2.equals(e). If this graph already contains such an edge, the call leaves this graph unchanged and returns false. Some graphs do not allow edge-multiplicity. In such cases, if the graph already contains an edge from the specified source to the specified target, than this method does not change the graph and returns
false. If the edge was added to the graph, returns
The source and target vertices must already be contained in this graph. If they are not found in graph IllegalArgumentException is thrown.
sourceVertex- source vertex of the edge.
targetVertex- target vertex of the edge.
e- edge to be added to this graph.
public boolean addVertex(V v)
v, to this graph if this graph contains no vertex
u.equals(v). If this graph already contains such vertex, the call leaves this graph unchanged and returns false. In combination with the restriction on constructors, this ensures that graphs never contain duplicate vertices.
Copyright © 2016. All rights reserved.