V
 the graph vertex typeE
 the graph edge typepublic class AsUnweightedGraph<V,E> extends GraphDelegator<V,E> implements Serializable
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 

AsUnweightedGraph(Graph<V,E> g)
Constructor for AsUnweightedGraph.

Modifier and Type  Method and Description 

double 
getEdgeWeight(E e)
Returns the weight assigned to a given edge.

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
containsEdge, removeAllEdges, removeAllEdges, removeAllVertices
public double getEdgeWeight(E e)
GraphDelegator
WeightedGraph.DEFAULT_EDGE_WEIGHT
), allowing weightedgraph algorithms to apply to
them where meaningful.getEdgeWeight
in interface Graph<V,E>
getEdgeWeight
in class GraphDelegator<V,E>
e
 edge of interestGraph.getEdgeWeight(E)
Copyright © 2016. All rights reserved.