KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > jgrapht > graph > DirectedSubgraph


1 /* ==========================================
2  * JGraphT : a free Java graph-theory library
3  * ==========================================
4  *
5  * Project Info: http://jgrapht.sourceforge.net/
6  * Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
7  *
8  * (C) Copyright 2003-2006, by Barak Naveh and Contributors.
9  *
10  * This library is free software; you can redistribute it and/or modify it
11  * under the terms of the GNU Lesser General Public License as published by
12  * the Free Software Foundation; either version 2.1 of the License, or
13  * (at your option) any later version.
14  *
15  * This library is distributed in the hope that it will be useful, but
16  * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17  * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
18  * License for more details.
19  *
20  * You should have received a copy of the GNU Lesser General Public License
21  * along with this library; if not, write to the Free Software Foundation,
22  * Inc.,
23  * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
24  */
25 /* ---------------------
26  * DirectedSubgraph.java
27  * ---------------------
28  * (C) Copyright 2003-2006, by Barak Naveh and Contributors.
29  *
30  * Original Author: Barak Naveh
31  * Contributor(s): Christian Hammer
32  *
33  * $Id: DirectedSubgraph.java 504 2006-07-03 02:37:26Z perfecthash $
34  *
35  * Changes
36  * -------
37  * 05-Aug-2003 : Initial revision (BN);
38  * 11-Mar-2004 : Made generic (CH);
39  * 28-May-2006 : Moved connectivity info from edge to graph (JVS);
40  *
41  */
42 package org.jgrapht.graph;
43
44 import java.util.*;
45
46 import org.jgrapht.*;
47
48
49 /**
50  * A directed graph that is a subgraph on other graph.
51  *
52  * @see Subgraph
53  */
54 public class DirectedSubgraph<V, E>
55     extends Subgraph<V, E>
56     implements DirectedGraph<V, E>
57 {
58
59     //~ Static fields/initializers --------------------------------------------
60
61     private static final long serialVersionUID = 3616445700507054133L;
62
63     //~ Constructors ----------------------------------------------------------
64
65     /**
66      * Creates a new directed subgraph.
67      *
68      * @param base the base (backing) graph on which the subgraph will be based.
69      * @param vertexSubset vertices to include in the subgraph. If <code>
70      * null</code> then all vertices are included.
71      * @param edgeSubset edges to in include in the subgraph. If <code>
72      * null</code> then all the edges whose vertices found in
73      * the graph are included.
74      */
75     public DirectedSubgraph(
76         DirectedGraph<V, E> base,
77         Set<V> vertexSubset,
78         Set<E> edgeSubset)
79     {
80         super(base, vertexSubset, edgeSubset);
81     }
82 }
83
Popular Tags