org.jgrapht.graph
Class SimpleDirectedGraph<V,E>
java.lang.Object
org.jgrapht.graph.AbstractGraph<V,E>
org.jgrapht.graph.AbstractBaseGraph<V,E>
org.jgrapht.graph.SimpleDirectedGraph<V,E>
- All Implemented Interfaces:
- Serializable, Cloneable, DirectedGraph<V,E>, Graph<V,E>
- Direct Known Subclasses:
- DirectedAcyclicGraph, SimpleDirectedWeightedGraph
public class SimpleDirectedGraph<V,E>
- extends AbstractBaseGraph<V,E>
- implements DirectedGraph<V,E>
A simple directed graph. A simple directed graph is a directed graph in which
neither multiple edges between any two vertices nor loops are permitted.
- See Also:
- Serialized Form
Methods inherited from class org.jgrapht.graph.AbstractBaseGraph |
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSet |
Methods inherited from interface org.jgrapht.Graph |
addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
SimpleDirectedGraph
public SimpleDirectedGraph(Class<? extends E> edgeClass)
- Creates a new simple directed graph.
- Parameters:
edgeClass
- class on which to base factory for edges
SimpleDirectedGraph
public SimpleDirectedGraph(EdgeFactory<V,E> ef)
- Creates a new simple directed graph with the specified edge factory.
- Parameters:
ef
- the edge factory of the new graph.
Copyright © 2013. All rights reserved.