java对树形结构深度优先的访问

//pairOfDisease.txt存储的是父子关系对（父---子）//写出的是树的各个分支public static Map dislist;public static BufferedWriter bw=null;public static Map node=new HashMap();;public static void main(String[] args) throws Exception {// TODO Auto-generated method stubBufferedReader br=new BufferedReader(new FileReader(new File("E:/ncRNA2disease/pairOfDisease.txt"))); bw=new BufferedWriter(new FileWriter(new File("E:/ncRNA2disease/diseaseTreePath.txt")));String s="";dislist=new HashMap();while((s=br.readLine())!=null){String[] rec=s.split("\t");if(dislist.containsKey(rec[0])){ArrayList currentlist=dislist.get(rec[0]);currentlist.add(rec[1]);dislist.put(rec[0],currentlist);}else{ArrayList newlist=new ArrayList();newlist.add(rec[1]);dislist.put(rec[0], newlist);}}System.out.println(dislist.size()+"sssss"+dislist.containsKey("prediabetes syndrome"));show(dislist.get("DOID:4!disease"));String path="DOID:4!disease";seek(path,dislist.get("DOID:4!disease"));}public static void seek(String path,ArrayList dis) throws Exception{int i=0; while(i<dis.size()){ if(dislist.containsKey(dis.get(i))){ seek(path+"$"+dis.get(i),dislist.get(dis.get(i))); }else{ bw.write(path+"$"+dis.get(i)); bw.flush(); bw.newLine(); } i++; } }public static void show(ArrayList dis){for(int i=0;i<dis.size();i++){System.out.println(dis.get(i));}}