#include <stdio.h>
#include "Fields.h"
#include "Dllist.h"
#include "rbTree.h"
#include "jrb.h"

const int NOT_VISITED = 0;
const int BEING_VISITED = 1;
const int DONE_VISITED = 2;

class Vertex;

class Edge {
public:
  Edge(Vertex *vtx1, Vertex *vtx2) {
    v1 = vtx1;
    v2 = vtx2;
  }
  Vertex *getVertex1() { return v1; }
  Vertex *getVertex2() { return v2; }

protected:
    Vertex *v1;
    Vertex *v2;
};

class Vertex {
protected:
  string name;
  dList<Edge *> edges;
  int nincident;
  bool visited;
public:
  Vertex(string n) {
    name = n;
    nincident = 0;
    int visited;
  }
  string getName() { return name; }
  int getVisited() { return visited; }
  int getNumIncident() { return nincident; }
  void firstEdge() { edges.first(); }
  void nextEdge() { edges.next(); }
  bool endOfEdges() { return edges.endOfList(); }
  Edge *getEdge() { return edges.get(); }

  void addEdge(Edge *e) { 
    edges.append(e); 
    e->getVertex2()->nincident++;
  }

  void deleteEdge() {
    Edge *e = edges.get();
    e->getVertex2()->nincident--;
    edges.deleteNode();
  }

  Vertex *visit()
  {
    Edge *e;
    Vertex *v2;

    if (visited == BEING_VISITED) {
      printf("Cycle: %s", name.c_str());
      return this;
    }
    if (visited == DONE_VISITED) return 0;

    visited = BEING_VISITED;
    for (edges.first(); !edges.endOfList(); edges.next()) {
      e = edges.get();
      v2 = e->getVertex2()->visit();
      if (v2 != 0) {
	printf(" <- %s", name.c_str());
	if (v2 == this) { printf("\n"); exit(1); }
	return v2;
      }
    }
    visited = DONE_VISITED;
    return 0;
  }
};

class Graph {
protected:
    rbTree<string> vertices;
public:
  Vertex *find(string name) {
    if (vertices.find(name)) 
      return (Vertex *)vertices.getVal().v;
    else
      return 0;
  }

  Vertex *insert(string name) {
    vertices.insert(name, new_jval_v(new Vertex(name)));
    return (Vertex *)vertices.getVal().v;
  }

  void firstVertex() { vertices.first(); }
  void nextVertex() { vertices.next(); }
  bool endOfVertices() { return vertices.endOfList(); }
  Vertex *getVertex() { return (Vertex *)vertices.getVal().v; }

  void deleteVertex(string name) {
    if (vertices.find(name))
      vertices.deleteNode();
  }

  bool empty() { return vertices.empty(); }
};

main() 
{
  Fields *f;
  Graph g;
  Vertex *v;
  Vertex *v2;
  Edge *e;
  string s;

  v = 0;

  f = new Fields();

  while (f->get_line() >= 0) {
    if (f->get_NF() > 0) {
      if (f->get_field(0) == "CLASS") {
        if (f->get_NF() != 2) {
          fprintf(stderr, "%d: CLASS name\n", f->get_line_number());
          exit(1);
        } 
        s = f->get_field(1);
	v = g.find(s);
        if (v == 0) {
          v = g.insert(s);
        } 
      } else if (f->get_field(0) == "PREREQ") {
        if (f->get_NF() != 2) {
          fprintf(stderr, "%d: PREREQ class\n", f->get_line_number());
          exit(1);
        } 
        if (v == 0) {
          fprintf(stderr, "%d: PREREQ -- no current vertex\n", 
                  f->get_line_number());
          exit(1);
        } 
        s = f->get_field(1);
        v2 = g.find(s);
        if (v2 == 0) {
          v2 = g.insert(s);
        } 
        e = new Edge(v2, v);
        v2->addEdge(e);
    
      } else {
          fprintf(stderr, "%d: lines must be CLASS or PREREQ\n", 
                   f->get_line_number());
          exit(1);
      }
    }
  }

  for (g.firstVertex(); !g.endOfVertices(); g.nextVertex()) {
    v = g.getVertex();
    if (v->getVisited() == NOT_VISITED) v->visit();
  }

  printf("No cycles\n");
}