All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.jgrapht.graph.DirectedWeightedPseudograph Maven / Gradle / Ivy

There is a newer version: 1.5.2
Show newest version
/*
 * (C) Copyright 2003-2018, by Barak Naveh and Contributors.
 *
 * JGraphT : a free Java graph-theory library
 *
 * This program and the accompanying materials are dual-licensed under
 * either
 *
 * (a) the terms of the GNU Lesser General Public License version 2.1
 * as published by the Free Software Foundation, or (at your option) any
 * later version.
 *
 * or (per the licensee's choosing)
 *
 * (b) the terms of the Eclipse Public License v1.0 as published by
 * the Eclipse Foundation.
 */
package org.jgrapht.graph;

import org.jgrapht.*;
import org.jgrapht.graph.builder.*;
import org.jgrapht.util.*;

import java.util.function.*;

/**
 * A directed weighted pseudograph. A directed weighted pseudograph is a non-simple directed graph
 * in which both graph loops and multiple (parallel) edges are permitted, and edges have weights.
 * 
 * @param  the graph vertex type
 * @param  the graph edge type
 * 
 */
public class DirectedWeightedPseudograph
    extends
    DirectedPseudograph
{
    private static final long serialVersionUID = -4775269773843490859L;

    /**
     * Creates a new weighted graph.
     *
     * @param edgeClass class on which to base the edge supplier
     */
    public DirectedWeightedPseudograph(Class edgeClass)
    {
        this(null, SupplierUtil.createSupplier(edgeClass));
    }

    /**
     * Creates a new weighted graph.
     * 
     * @param vertexSupplier the vertex supplier, can be null
     * @param edgeSupplier the edge supplier, can be null
     */
    public DirectedWeightedPseudograph(Supplier vertexSupplier, Supplier edgeSupplier)
    {
        super(vertexSupplier, edgeSupplier, true);
    }

    /**
     * Create a builder for this kind of graph.
     * 
     * @param edgeClass class on which to base factory for edges
     * @param  the graph vertex type
     * @param  the graph edge type
     * @return a builder for this kind of graph
     */
    public static  GraphBuilder> createBuilder(
            Class edgeClass)
    {
        return new GraphBuilder<>(new DirectedWeightedPseudograph<>(edgeClass));
    }

    /**
     * Create a builder for this kind of graph.
     * 
     * @param edgeSupplier the edge supplier
     * @param  the graph vertex type
     * @param  the graph edge type
     * @return a builder for this kind of graph
     */
    public static  GraphBuilder> createBuilder(
            Supplier edgeSupplier)
    {
        return new GraphBuilder<>(new DirectedWeightedPseudograph<>(null, edgeSupplier));
    }

    /**
     * Creates a new weighted graph with the specified edge factory.
     *
     * @param ef the edge factory of the new graph.
     * @deprecated Use suppliers instead
     */
    @Deprecated
    public DirectedWeightedPseudograph(EdgeFactory ef)
    {
        super(ef, true);
    }

    /**
     * Create a builder for this kind of graph.
     * 
     * @param ef the edge factory of the new graph
     * @param  the graph vertex type
     * @param  the graph edge type
     * @return a builder for this kind of graph
     * @deprecated Use suppliers instead
     */
    @Deprecated
    public static  GraphBuilder> createBuilder(
            EdgeFactory ef)
    {
        return new GraphBuilder<>(new DirectedWeightedPseudograph<>(ef));
    }
}

// End DirectedWeightedPseudograph.java




© 2015 - 2025 Weber Informatics LLC | Privacy Policy