package javakurs.uebung08;

import java.util.BitSet;
import java.util.Comparator;
import java.util.List;

/**
 * {@link DirectedGraph}
 *
 * @author
 * @version $Id$
 */
public class DirectedGraph<EdgeInfo> extends DirectedGraphBase {

  /**
   * {@inheritDoc}
   */
  @Override
  public int newVertex() {

    // TODO Auto-generated method stub
    return 0;
  }

  /**
   * {@inheritDoc}
   */
  @Override
  public Edge newEdge(Object edgeInfo, int from, int to) {

    // TODO Auto-generated method stub
    return null;
  }

  /**
   * {@inheritDoc}
   */
  @Override
  public void removeEdge(Edge edge) {

    // TODO Auto-generated method stub

  }

  /**
   * {@inheritDoc}
   */
  @Override
  public void removeVertex(int vertex) {

    // TODO Auto-generated method stub

  }

  /**
   * {@inheritDoc}
   */
  @Override
  public Edge findEdge(int vertex, Object edgeInfo, Comparator comp) {

    // TODO Auto-generated method stub
    return null;
  }

  /**
   * {@inheritDoc}
   */
  @Override
  public List findEdges(int vertex, Object edgeInfo, Comparator comp) {

    // TODO Auto-generated method stub
    return null;
  }

  /**
   * {@inheritDoc}
   */
  @Override
  protected void dfsVisit(int vertex, GraphVisitor visitor, BitSet visited) {

    // TODO Auto-generated method stub

  }

  /**
   * {@inheritDoc}
   */
  @Override
  public void dfs(GraphVisitor visitor) {

    // TODO Auto-generated method stub

  }

  /**
   * {@inheritDoc}
   */
  @Override
  protected void bfsVisit(int vertex, GraphVisitor visitor, BitSet visited) {

    // TODO Auto-generated method stub

  }

  /**
   * {@inheritDoc}
   */
  @Override
  public void bfs(GraphVisitor visitor) {

    // TODO Auto-generated method stub

  }

}
