com.salesforce.jgrapht.graph.Pseudograph Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of AptSpringProcessor Show documentation
Show all versions of AptSpringProcessor Show documentation
This project contains the apt processor that implements all the checks enumerated in @Verify. It is a self contained, and
shaded jar.
The newest version!
/*
* (C) Copyright 2003-2018, 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 com.salesforce.jgrapht.graph;
import com.salesforce.jgrapht.graph.builder.*;
import com.salesforce.jgrapht.util.*;
import java.util.function.*;
/**
* A pseudograph. A pseudograph is a non-simple undirected 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 Pseudograph
extends
AbstractBaseGraph
{
private static final long serialVersionUID = -7574564204896552581L;
/**
* Creates a new graph.
*
* @param edgeClass class on which to base the edge supplier
*/
public Pseudograph(Class extends E> 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 Pseudograph(Supplier vertexSupplier, Supplier edgeSupplier, boolean weighted)
{
super(
vertexSupplier, edgeSupplier,
new DefaultGraphType.Builder()
.undirected().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 extends E> edgeClass)
{
return new GraphBuilder<>(new Pseudograph<>(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 Pseudograph<>(null, edgeSupplier, false));
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy