Class DirectedPseudograph<V,E>

java.lang.Object
org.jgrapht.graph.AbstractGraph<V,E>
org.jgrapht.graph.AbstractBaseGraph<V,E>
org.jgrapht.graph.DirectedPseudograph<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:
DirectedWeightedPseudograph

public class DirectedPseudograph<V,E> extends AbstractBaseGraph<V,E>
A directed pseudograph. A directed pseudograph is a non-simple directed graph in which both graph loops and multiple (parallel) edges are permitted. If you're unsure about pseudographs, see: http://mathworld.wolfram.com/Pseudograph.html.
See Also:
  • Constructor Details

    • DirectedPseudograph

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

      public DirectedPseudograph(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 DirectedPseudograph<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 DirectedPseudograph<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