/* ========================================== * JGraphT : a free Java graph-theory library * ========================================== * * Project Info: http://jgrapht.sourceforge.net/ * Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh) * * (C) Copyright 2003-2008, by Barak Naveh and Contributors. * * This library is free software; you can redistribute it and/or modify it * under the terms of the GNU Lesser General Public License as published by * the Free Software Foundation; either version 2.1 of the License, or * (at your option) any later version. * * This library is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public * License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this library; if not, write to the Free Software Foundation, * Inc., * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. */ /* ----------------------------- * DirectedWeightedSubgraph.java * ----------------------------- * (C) Copyright 2003-2008, by Barak Naveh and Contributors. * * Original Author: Barak Naveh * Contributor(s): Christian Hammer * * $Id: DirectedWeightedSubgraph.java 755 2012-01-18 23:50:37Z perfecthash $ * * Changes * ------- * 05-Aug-2003 : Initial revision (BN); * 06-Aug-2005 : Made generic (CH); * 28-May-2006 : Moved connectivity info from edge to graph (JVS); * */ package edu.nd.nina.graph; import java.util.*; import edu.nd.nina.*; /** * A directed weighted graph that is a subgraph on other graph. * * @see Subgraph */ public class DirectedWeightedSubgraph<V, E> extends DirectedSubgraph<V, E> implements WeightedGraph<V, E> { //~ Static fields/initializers --------------------------------------------- private static final long serialVersionUID = 3905799799168250680L; //~ Constructors ----------------------------------------------------------- /** * 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 <code> * null</code> then all vertices are included. * @param edgeSubset edges to in include in the subgraph. If <code> * null</code> then all the edges whose vertices found in the graph * are included. */ public DirectedWeightedSubgraph( WeightedGraph<V, E> base, Set<V> vertexSubset, Set<E> edgeSubset) { super((DirectedGraph<V, E>) base, vertexSubset, edgeSubset); } } // End DirectedWeightedSubgraph.java