Robust/src/Benchmarks/oooJava/simplebh/TreeDotGen.java

   1 import java.io.*;
   2
   3 public class TreeDotGen{
   4
   5     public int idx;
   6
   7     public static void main(String args[]){
   8         TreeDotGen t=new TreeDotGen();
   9         t.generate();
  10     }
  11
  12     public void generate(){
  13
  14         try{
  15             FileWriter fstream=new FileWriter("out.dot");
  16             BufferedWriter out=new BufferedWriter(fstream);
  17
  18             out.write("digraph btree{\n");
  19             idx=0;
  20             generateTree(0,out);
  21
  22             out.write("}\n");
  23
  24             out.close();
  25         }catch(Exception e){
  26
  27         }
  28
  29     }
  30
  31     public void generateTree(int parentIdx,BufferedWriter out) throws IOException{
  32
  33
  34         //left
  35
  36         int leftIdx= ++idx;
  37         out.write("N"+parentIdx+"->"+"N"+leftIdx+"\n");
  38
  39         //right
  40         int rightIdx= ++idx;
  41         out.write("N"+parentIdx+"->"+"N"+rightIdx+"\n");
  42
  43         if(idx<100){
  44             generateTree(leftIdx,out);
  45             generateTree(rightIdx,out);
  46         }
  47     }
  48
  49 }