com.salesforce.jgrapht.graph.DirectedWeightedSubgraph 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.
/*
* (C) Copyright 2003-2017, 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 com.salesforce.jgrapht.graph;
import java.util.*;
import com.salesforce.jgrapht.*;
import com.salesforce.jgrapht.util.*;
/**
* A directed weighted graph that is a subgraph of another graph.
*
* @param the graph vertex type
* @param the graph edge type
*
* @see Subgraph
*/
public class DirectedWeightedSubgraph
extends DirectedSubgraph
implements WeightedGraph
{
private static final long serialVersionUID = 3905799799168250680L;
/**
* Creates a new weighted directed subgraph.
*
* @param base the base (backing) graph on which the subgraph will be based.
* @param vertexSubset vertices to include in the subgraph. If null
then all
* vertices are included.
* @param edgeSubset edges to in include in the subgraph. If null
then all the
* edges whose vertices found in the graph are included.
*/
public DirectedWeightedSubgraph(
WeightedGraph base, Set extends V> vertexSubset, Set extends E> edgeSubset)
{
super(TypeUtil.uncheckedCast(base, null), vertexSubset, edgeSubset);
}
/**
* Creates a new weighted directed induced subgraph.
*
* @param base the base (backing) graph on which the subgraph will be based.
* @param vertexSubset vertices to include in the subgraph. If null
then all
* vertices are included.
*/
public DirectedWeightedSubgraph(WeightedGraph base, Set extends V> vertexSubset)
{
this(base, vertexSubset, null);
}
/**
* Creates a new weighted directed induced subgraph with all vertices included.
*
* @param base the base (backing) graph on which the subgraph will be based.
*/
public DirectedWeightedSubgraph(WeightedGraph base)
{
this(base, null, null);
}
}
// End DirectedWeightedSubgraph.java
© 2015 - 2025 Weber Informatics LLC | Privacy Policy