---

Graph.java

package gov.nasa.arc.ase.util.graph;

import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
//#ifdef JDK11



//#else JDK11
import java.util.List;
import java.util.Iterator;
import java.util.LinkedList;
//#endif JDK11

public class Graph {
  public static final int SM_FORMAT = 0;
  public static final int FSP_FORMAT = 1;

  private List nodes;
  private Node init;
  private Attributes attributes;

  public Graph()        { init(null); }  
  public Graph(Attributes a)    { init(a); }  
  synchronized void addNode(Node n) {
    nodes.add(n);
    if(init == null) init = n;

    number();
  }  
  private synchronized void dfs(Node n, Visitor v) {
    final Visitor visitor = v;

    if(n.getBooleanAttribute("_reached")) return;
    n.setBooleanAttribute("_reached", true);

    v.visitNode(n);

    n.forAllEdges(new EmptyVisitor() {
    public void visitEdge(Edge e) {
      dfs(e.getNext(), visitor);
    }
    });
  }  
  public synchronized void dfs(Visitor v) {
    if(init == null) return;

    forAllNodes(new EmptyVisitor() {
    public void visitNode(Node n) {
      n.setBooleanAttribute("_reached", false);
    }
    });

    dfs(init, v);

    forAllNodes(new EmptyVisitor() {
    public void visitNode(Node n) {
      n.setBooleanAttribute("_reached", false);
    }
    });

  }  
  public synchronized void forAll(Visitor v) {
    for(Iterator i = new LinkedList(nodes).iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();

      v.visitNode(n);

      n.forAllEdges(v);
    }
  }  
  public synchronized void forAllEdges(Visitor v) {
    for(Iterator i = new LinkedList(nodes).iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();

      n.forAllEdges(v);
    }
  }  
  public synchronized void forAllNodes(Visitor v) {
    for(Iterator i = new LinkedList(nodes).iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();
      v.visitNode(n);
    }
  }  
  public boolean getBooleanAttribute(String name) { return attributes.getBoolean(name); }  
  public int getEdgeCount() {
    int count = 0;
    
    for(Iterator i = new LinkedList(nodes).iterator(); i.hasNext(); )
      count += ((Node)i.next()).getOutgoingEdgeCount();

    return count;
  }  
  public Node getInit() { return init; }  
  public int getIntAttribute(String name) { return attributes.getInt(name); }  
  public Node getNode(int id) { 
    for(Iterator i = nodes.iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();
      if(n.getId() == id) return n;
    }

    return null;
  }  
  public int getNodeCount() { return nodes.size(); }  
  public List getNodes() { return new LinkedList(nodes); }  
  public String getStringAttribute(String name) { return attributes.getString(name); }  
  private void init(Attributes a) {
    if(a == null)
      attributes = new Attributes();
    else
      attributes = a;
    nodes = new LinkedList();
    init = null;
  }  
  public static Graph load() throws IOException { return load(new BufferedReader(new InputStreamReader(System.in))); }  
  private static Graph load(BufferedReader in) throws IOException {
    int ns = readInt(in);
    Node[] nodes = new Node[ns];

    Graph g = new Graph(readAttributes(in));

    for(int i = 0; i < ns; i++) {
      int nt = readInt(in);
      if(nodes[i] == null)
    nodes[i] = new Node(g, readAttributes(in));
      else
    nodes[i].setAttributes(readAttributes(in));

      for(int j = 0; j < nt; j++) {
    int nxt = readInt(in);
    String gu = readString(in);
    String ac = readString(in);

    if(nodes[nxt] == null) nodes[nxt] = new Node(g);

    new Edge(nodes[i], nodes[nxt], gu, ac, readAttributes(in));
      }
    }

    g.number();

    return g;
  }  
  public static Graph load(String fname) throws IOException { return load(new BufferedReader(new FileReader(fname))); }  
  private synchronized void number() {
    int cnt;

    if(init != null) {
      init.setId(0);
      cnt = 1;
    } else
      cnt = 0;

    for(Iterator i = nodes.iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();

      if(n != init) n.setId(cnt++);
    }
  }  
  private static Attributes readAttributes(BufferedReader in) throws IOException {
    return new Attributes(readLine(in));
  }  
  private static int readInt(BufferedReader in) throws IOException {
    return Integer.parseInt(readLine(in));
  }  
  private static String readLine(BufferedReader in) throws IOException {
    String line;

    do {
      line = in.readLine();
      int idx = line.indexOf('#');
      if(idx != -1) line = line.substring(0, idx);
      line = line.trim();
    } while(line.length() == 0);

    return line;
  }  
  private static String readString(BufferedReader in) throws IOException {
    return readLine(in);
  }  
  synchronized void removeNode(Node n) {
    nodes.remove(n);

    if(init == n)
      if(nodes.size() != 0)
    init = (Node)nodes.get(0);
      else
    init = null;

    number();
  }  
  public synchronized void save() { save(System.out, SM_FORMAT); }  
  public synchronized void save(int format) { save(System.out, format); }  
  private synchronized void save(PrintStream out, int format) {
    switch(format) {
      case SM_FORMAT: save_sm(out); break;
      case FSP_FORMAT: save_fsp(out); break;
    }
  }  
  public synchronized void save(String fname) throws IOException { save(new PrintStream(new FileOutputStream(fname)), SM_FORMAT); }  
  public synchronized void save(String fname, int format) throws IOException { save(new PrintStream(new FileOutputStream(fname)), format); }  
  // Modified by ckong - Sept 7, 2001
  private synchronized void save_fsp(PrintStream out) {
    if(init != null) out.println("RES = S" + init.getId());
    
    for(Iterator i = nodes.iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();

      n.save(out, FSP_FORMAT);
      if(i.hasNext())
    //System.out.println(",");
    out.println(",");
      else
    //System.out.println(".");
    out.println(".");
    }
    int nsets = getIntAttribute("nsets");
    if(nsets == 0) {
      boolean first = true;

      //System.out.print("AS = { ");
      out.print("AS = { ");
      for(Iterator i = nodes.iterator(); i.hasNext(); ) {
    Node n = (Node)i.next();

    if(n.getBooleanAttribute("accepting")) {
      if(!first)
        //System.out.print(", ");
        out.print(", ");
      else
        first = false;
      //System.out.print("S" + n.getId());
      out.print("S" + n.getId());
    }
      }
      //System.out.println(" }");
      out.println(" }");
    } else {
      for(int k = 0; k < nsets; k++) {
    boolean first = true;

    //System.out.print("AS"+k+" = { ");
    out.print("AS"+k+" = { ");
    for(Iterator i = nodes.iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();

      if(n.getBooleanAttribute("acc"+k)) {
        if(!first)
          //System.out.print(", ");
          out.print(", ");
        else
          first = false;
        //System.out.print("S" + n.getId());
        out.print("S" + n.getId());
      }
    }
    //System.out.println(" }");
    out.println(" }");
      }
    }
    if (out != System.out)
      out.close();
  }  
  private synchronized void save_sm(PrintStream out) {
    out.println(nodes.size());
    out.println(attributes);
    if(init != null) init.save(out, SM_FORMAT);
    for(Iterator i = nodes.iterator(); i.hasNext(); ) {
      Node n = (Node)i.next();

      if(n != init) n.save(out, SM_FORMAT);
    }
  }  
  synchronized public void setAttributes(Attributes a) { attributes = new Attributes(a); }  
  public synchronized void setBooleanAttribute(String name, boolean value) { attributes.setBoolean(name, value); }  
  public synchronized void setInit(Node n) {
    if(nodes.contains(n)) {
      init = n;
      number();
    }
  }  
  public synchronized void setIntAttribute(String name, int value) { attributes.setInt(name, value); }  
  public synchronized void setStringAttribute(String name, String value) { attributes.setString(name, value); }  
}

---