Class WeightedPseudograph<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>, UndirectedGraph<V,​E>, WeightedGraph<V,​E>

    public class WeightedPseudograph<V,​E>
    extends Pseudograph<V,​E>
    implements WeightedGraph<V,​E>
    A weighted pseudograph. A weighted pseudograph is a non-simple undirected graph in which both graph loops and multiple edges are permitted. The edges of a weighted pseudograph have weights. If you're unsure about pseudographs, see: http://mathworld.wolfram.com/Pseudograph.html.
    See Also:
    Serialized Form
    • Constructor Detail

      • WeightedPseudograph

        public WeightedPseudograph​(EdgeFactory<V,​E> ef)
        Creates a new weighted pseudograph with the specified edge factory.
        Parameters:
        ef - the edge factory of the new graph.
      • WeightedPseudograph

        public WeightedPseudograph​(java.lang.Class<? extends E> edgeClass)
        Creates a new weighted pseudograph.
        Parameters:
        edgeClass - class on which to base factory for edges
    • Method Detail

      • builder

        public static <V,​E> UndirectedWeightedGraphBuilderBase<V,​E,​? extends WeightedPseudograph<V,​E>,​?> builder​(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
      • builder

        public static <V,​E> UndirectedWeightedGraphBuilderBase<V,​E,​? extends WeightedPseudograph<V,​E>,​?> builder​(EdgeFactory<V,​E> ef)
        Create a builder for this kind of graph.
        Type Parameters:
        V - the graph vertex type
        E - the graph edge type
        Parameters:
        ef - the edge factory of the new graph
        Returns:
        a builder for this kind of graph