/* ==========================================
* 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 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.
*/
/* ----------------------------
* ListenableDirectedGraph.java
* ----------------------------
* (C) Copyright 2003-2008, by Barak Naveh and Contributors.
*
* Original Author: Barak Naveh
* Contributor(s): Christian Hammer
*
* $Id$
*
* Changes
* -------
* 05-Aug-2003 : Initial revision (BN);
* 11-Mar-2004 : Made generic (CH);
* 28-May-2006 : Moved connectivity info from edge to graph (JVS);
*
*/
package org.jgrapht.graph;
import org.jgrapht.*;
/**
* A directed graph which is also {@link org.jgrapht.ListenableGraph}.
*
* @see DefaultListenableGraph
*/
public class ListenableDirectedGraph<V, E>
extends DefaultListenableGraph<V, E>
implements DirectedGraph<V, E>
{
private static final long serialVersionUID = 3257571698126368824L;
/**
* Creates a new listenable directed graph.
*
* @param edgeClass class on which to base factory for edges
*/
public ListenableDirectedGraph(Class<? extends E> edgeClass)
{
this(new DefaultDirectedGraph<V, E>(edgeClass));
}
/**
* Creates a new listenable directed graph.
*
* @param base the backing graph.
*/
public ListenableDirectedGraph(DirectedGraph<V, E> base)
{
super(base);
}
}
// End ListenableDirectedGraph.java