org.jgrapht.graph.DefaultDirectedWeightedGraph Maven / Gradle / Ivy
The newest version!
/*
* (C) Copyright 2003-2023, by Barak Naveh and Contributors.
*
* JGraphT : a free Java graph-theory library
*
* See the CONTRIBUTORS.md file distributed with this work for additional
* information regarding copyright ownership.
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License 2.0 which is available at
* http://www.eclipse.org/legal/epl-2.0, or the
* GNU Lesser General Public License v2.1 or later
* which is available at
* http://www.gnu.org/licenses/old-licenses/lgpl-2.1-standalone.html.
*
* SPDX-License-Identifier: EPL-2.0 OR LGPL-2.1-or-later
*/
package org.jgrapht.graph;
import org.jgrapht.graph.builder.*;
import org.jgrapht.util.*;
import java.util.function.*;
/**
* The default implementation of a directed weighted graph. A default directed weighted graph is a
* non-simple directed graph in which multiple (parallel) edges between any two vertices are
* not permitted, but loops are. The graph has weights on its edges.
*
* @param the graph vertex type
* @param the graph edge type
*
* @see DefaultDirectedGraph
*/
public class DefaultDirectedWeightedGraph
extends DefaultDirectedGraph
{
private static final long serialVersionUID = -4867672646995721544L;
/**
* Creates a new graph.
*
* @param edgeClass class on which to base the edge supplier
*/
public DefaultDirectedWeightedGraph(Class edgeClass)
{
this(null, SupplierUtil.createSupplier(edgeClass));
}
/**
* Creates a new graph.
*
* @param vertexSupplier the vertex supplier, can be null
* @param edgeSupplier the edge supplier, can be null
*/
public DefaultDirectedWeightedGraph(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 DefaultDirectedWeightedGraph<>(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 DefaultDirectedWeightedGraph<>(null, edgeSupplier));
}
}