Class SimpleDirectedWeightedGraph<V,​E>

java.lang.Object
org.jgrapht.graph.AbstractGraph<V,​E>
org.jgrapht.graph.AbstractBaseGraph<V,​E>
org.jgrapht.graph.SimpleDirectedGraph<V,​E>
org.jgrapht.graph.SimpleDirectedWeightedGraph<V,​E>
Type Parameters:
V - the graph vertex type
E - the graph edge type
All Implemented Interfaces:
java.io.Serializable, java.lang.Cloneable, Graph<V,​E>

public class SimpleDirectedWeightedGraph<V,​E>
extends SimpleDirectedGraph<V,​E>
A simple directed weighted graph. A simple directed weighted graph is a simple directed graph for which edges are assigned weights.
See Also:
Serialized Form
  • Constructor Details

    • SimpleDirectedWeightedGraph

      public SimpleDirectedWeightedGraph​(java.lang.Class<? extends E> edgeClass)
      Creates a new graph.
      Parameters:
      edgeClass - class on which to base the edge supplier
    • SimpleDirectedWeightedGraph

      public SimpleDirectedWeightedGraph​(java.util.function.Supplier<V> vertexSupplier, java.util.function.Supplier<E> edgeSupplier)
      Creates a new graph.
      Parameters:
      vertexSupplier - the vertex supplier, can be null
      edgeSupplier - the edge supplier, can be null
  • Method Details

    • createBuilder

      public static <V,​ E> GraphBuilder<V,​E,​? extends SimpleDirectedWeightedGraph<V,​E>> createBuilder​(java.lang.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 SimpleDirectedWeightedGraph<V,​E>> createBuilder​(java.util.function.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
      Returns:
      a builder for this kind of graph