org.jgrapht.graph.DirectedPseudograph Maven / Gradle / Ivy
/*
* (C) Copyright 2004-2020, by Christian Hammer 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.*;
/**
* 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.
*
* @param the graph vertex type
* @param the graph edge type
*
*/
public class DirectedPseudograph
extends
AbstractBaseGraph
{
private static final long serialVersionUID = -7461248851245878913L;
/**
* Creates a new graph.
*
* @param edgeClass class on which to base the edge supplier
*/
public DirectedPseudograph(Class edgeClass)
{
this(null, SupplierUtil.createSupplier(edgeClass), false);
}
/**
* Creates a new graph.
*
* @param vertexSupplier the vertex supplier, can be null
* @param edgeSupplier the edge supplier, can be null
* @param weighted whether the graph is weighted or not
*/
public DirectedPseudograph(
Supplier vertexSupplier, Supplier edgeSupplier, boolean weighted)
{
super(
vertexSupplier, edgeSupplier,
new DefaultGraphType.Builder()
.directed().allowMultipleEdges(true).allowSelfLoops(true).weighted(weighted)
.build());
}
/**
* 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 DirectedPseudograph<>(edgeClass));
}
/**
* Create a builder for this kind of graph.
*
* @param edgeSupplier the edge supplier of the new graph
* @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 DirectedPseudograph<>(null, edgeSupplier, false));
}
}