// Copyright 2003, Trustees of Indiana University
// Please see the license in the file ../LICENSE

import java.lang.System;

public class printing_visitor<Graph,Vertex,Edge>
      implements Visitor<Graph,Vertex,Edge> {
  public void initialize_vertex(Vertex u, Graph g) {
    System.out.println("initialize "+u+" in "+g);
  }

  public void discover_vertex(Vertex u, Graph g) {
    System.out.println("discover "+u+" in "+g);
  }

  public void finish_vertex(Vertex u, Graph g) {
    System.out.println("finish "+u+" in "+g);
  }

  public void examine_edge(Edge e, Graph g) {
    System.out.println("examine "+e+" in "+g);
  }

  public void tree_edge(Edge e, Graph g) {
    System.out.println("tree "+e+" in "+g);
  }

  public void non_tree_edge(Edge e, Graph g) {
    System.out.println("nontree "+e+" in "+g);
  }

  public void gray_target(Edge e, Graph g) {
    System.out.println("gray target "+e+" in "+g);
  }

  public void black_target(Edge e, Graph g) {
    System.out.println("black target "+e+" in "+g);
  }
}