V
- the graph vertex typeE
- the graph edge typepublic class AsUnweightedDirectedGraph<V,E> extends AsUnweightedGraph<V,E> implements DirectedGraph<V,E>
Note that edges returned by this graph's accessors are really just the edges of the underlying directed graph.
This graph does not pass the hashCode and equals operations through to the backing graph, but relies on Object's equals and hashCode methods. This graph will be serializable if the backing graph is serializable.
Constructor and Description |
---|
AsUnweightedDirectedGraph(DirectedGraph<V,E> g)
Constructor for AsUnweightedGraph.
|
getEdgeWeight
addEdge, addEdge, addVertex, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, 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
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet
public AsUnweightedDirectedGraph(DirectedGraph<V,E> g)
g
- the backing graph over which an unweighted view is to be created.Copyright © 2017. All rights reserved.