/*
 * CS3DiGraph.java
 *
 * Version:
 *     $Id$
 *
 * Revisions:
 *     $Log$
 */

import java.util.Collection;

/**
 * Write a description of class CS3DiGraph here.
 *
 * @author Danny Lee
 */
public class CS3DiGraph<VertexKey, VertexData, EdgeData> implements DiGraph
{

    

    public CS3DiGraph() {
        
    }
    public void addEdge( VertexKey fromKey, VertexKey toKey, EdgeData data ) {
        
    }

    public void addVertex( VertexKey key, VertexData data ) {
        
    }

    public void clear() {
        
    }

    public Collection<EdgeData> edgeData() {
        return null;
    }

    public EdgeData getEdgeData( VertexKey fromKey, VertexKey toKey ) {
        return null;
    }

    public VertexData getVertexData( VertexKey key ) throws NoSuchVertexException  {
        return null;
    }

    public int inDegree( VertexKey key ) {
        return -1;
    }

    public boolean isEdge( VertexKey fromKey, VertexKey toKey ) throws NoSuchVertexException {
        return false;
    }

    public boolean isVertex( VertexKey key ) {
        return false;
    }

    public Collection<VertexData> neighborData( VertexKey key ) throws NoSuchVertexException{
        return null;
    }

    public Collection<VertexKey> neighborKeys( VertexKey key )throws NoSuchVertexException {
        return null;
    }

    public int numVertices() {
        return -1;
    }

    public int outDegree( VertexKey key ) {
        return -1;
    }

    public Collection<VertexData> vertexData() {
        return null;
    }

    public Collection<VertexKey> vertexKeys() {
        return null;
    }

} // CS3DiGraph