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 type

E - the graph edge type

All Implemented Interfaces:

Serializable, Cloneable, Graph<V,E>

Direct Known Subclasses:

SimpleDirectedWeightedGraph

public class SimpleDirectedGraph<V,E>
extends AbstractBaseGraph<V,E>

A simple directed graph. A simple directed graph is a directed graph in which neither multiple (parallel) edges between any two vertices nor loops are permitted.

See Also:

• Serialized Form

Field Summary

Fields

Modifier and Type	Field	Description
private static final long	serialVersionUID

Fields inherited from interface Graph

DEFAULT_EDGE_WEIGHT

Constructor Summary

Constructors

Constructor	Description
SimpleDirectedGraph(Class<? extends E> edgeClass)	Creates a new graph.
SimpleDirectedGraph(Supplier<V> vertexSupplier, Supplier<E> edgeSupplier, boolean weighted)	Creates a new graph.

Method Summary

Modifier and Type	Method	Description
static <V,E> GraphBuilder<V, E, ? extends SimpleDirectedGraph<V,E>>	createBuilder(Class<? extends E> edgeClass)	Create a builder for this kind of graph.
static <V,E> GraphBuilder<V, E, ? extends SimpleDirectedGraph<V,E>>	createBuilder(Supplier<E> edgeSupplier)	Create a builder for this kind of graph.

Methods inherited from class AbstractBaseGraph

addEdge, addEdge, addVertex, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeSource, getEdgeSupplier, getEdgeTarget, getEdgeWeight, getType, getVertexSupplier, incomingEdgesOf, inDegreeOf, iterables, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSupplier, setEdgeWeight, setVertexSupplier, vertexSet

Methods inherited from class AbstractGraph

assertVertexExist, containsEdge, equals, hashCode, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets

Methods inherited from class Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface Graph

containsEdge, removeAllEdges, removeAllEdges, removeAllVertices, setEdgeWeight

Field Details

serialVersionUID

private static final long serialVersionUID

See Also:

• Constant Field Values

Constructor Details

SimpleDirectedGraph

public SimpleDirectedGraph(Class<? extends E> edgeClass)

Creates a new graph.

Parameters:

edgeClass - class on which to base the edge supplier

SimpleDirectedGraph

public SimpleDirectedGraph(Supplier<V> vertexSupplier,
 Supplier<E> edgeSupplier,
 boolean weighted)

Creates a new graph.

Parameters:

vertexSupplier - the vertex supplier, can be null

edgeSupplier - the edge supplier, can be null

weighted - whether the graph is weighted or not

Method Details

createBuilder

public static <V,E>
GraphBuilder<V, E, ? extends SimpleDirectedGraph<V,E>> createBuilder(Class<? extends E> edgeClass)

Create a builder for this kind of graph.

Type Parameters:

V - the graph vertex type

E - the graph edge type

Parameters:

edgeClass - class on which to base factory for edges

Returns:

a builder for this kind of graph

createBuilder

public static <V,E>
GraphBuilder<V, E, ? extends SimpleDirectedGraph<V,E>> createBuilder(Supplier<E> edgeSupplier)

Create a builder for this kind of graph.

Type Parameters:

V - the graph vertex type

E - the graph edge type

Parameters:

edgeSupplier - the edge supplier of the new graph

Returns:

a builder for this kind of graph