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>
-
- Type Parameters:
V- the graph vertex typeE- the graph edge type
- All Implemented Interfaces:
- java.io.Serializable, java.lang.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
-
-
Constructor Summary
Constructors Constructor and Description SimpleDirectedGraph(java.lang.Class<? extends E> edgeClass)Creates a new simple directed graph.SimpleDirectedGraph(EdgeFactory<V,E> ef)Creates a new simple directed graph with the specified edge factory.
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method and Description static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?>builder(java.lang.Class<? extends E> edgeClass)Create a builder for this kind of graph.static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?>builder(EdgeFactory<V,E> ef)Create a builder for this kind of graph.-
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, setEdgeWeight, vertexSet
-
Methods inherited from class org.jgrapht.graph.AbstractGraph
containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllVertices, toString
-
Methods inherited from interface org.jgrapht.DirectedGraph
incomingEdgesOf, inDegreeOf, outDegreeOf, outgoingEdgesOf
-
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
-
-
-
-
Constructor Detail
-
SimpleDirectedGraph
public SimpleDirectedGraph(java.lang.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.
-
-
Method Detail
-
builder
public static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> builder(java.lang.Class<? extends E> edgeClass)
Create a builder for this kind of graph.- Type Parameters:
V- the graph vertex typeE- the graph edge type- Parameters:
edgeClass- class on which to base factory for edges- Returns:
- a builder for this kind of graph
-
builder
public static <V,E> DirectedGraphBuilderBase<V,E,? extends SimpleDirectedGraph<V,E>,?> builder(EdgeFactory<V,E> ef)
Create a builder for this kind of graph.- Type Parameters:
V- the graph vertex typeE- the graph edge type- Parameters:
ef- the edge factory of the new graph- Returns:
- a builder for this kind of graph
-
-
DataMelt 3.0 © DataMelt by jWork.ORG