import java.util.ArrayList;
import java.util.Collections;
public class test
{
    public static void test(){
        
    Graph g  = new Graph();
    
    for (int i = 1; i <= 22; i++){
        g.addNode(i);
    }
    
    g.addEdge(1,4,1,false);
    g.addEdge(1,2,1,false);
    g.addEdge(1,5,1,false);
    g.addEdge(2,3,1,false);
    g.addEdge(2,6,1,false);
    g.addEdge(2,9,1,false);
    g.addEdge(3,7,1,false);
    g.addEdge(4,8,1,false);
    g.addEdge(5,8,1,false);
    g.addEdge(5,12,1,false);
    g.addEdge(5,11,1,false);
    g.addEdge(5,10,1,false);
    g.addEdge(6,13,1,false);
    g.addEdge(7,18,1,false);
    g.addEdge(7,14,1,false);
    g.addEdge(7,17,1,false);
    g.addEdge(9,10,1,false);
    g.addEdge(11,15,1,false);
    g.addEdge(11,16,1,false);
    g.addEdge(13,19,1,false);
    g.addEdge(13,16,1,false);
    g.addEdge(14,17,1,false);
    g.addEdge(15,16,1,false);
    g.addEdge(15,22,1,false);
    g.addEdge(16,20,1,false);
    g.addEdge(21,22,1,false);
    
    Node n = g.getNode(16);
    ArrayList<Node> targets = n.getTargets(); 
    Collections.sort(targets);
    /*for (Node target : targets){
        System.out.println(target.getNumber());
    }
    ArrayList<Node> b = g.breitensuche(1);
    for (Node t: b){
        System.out.println(t.getNumber());
    }*/
    ArrayList<Node> t = g.tiefensuche(21);
    for (Node r: t){
        System.out.println(r.getNumber());
    }
}
public static void test2(){
    Graph g = new Graph();
    for(int i = 1; i <= 9 ; i++){
        g.addNode(i);
    }
    g.addEdge(1,6,4,false);
    g.addEdge(6,7,2,false);
    g.addEdge(1,3,3,false);
    g.addEdge(6,5,4,false);
    g.addEdge(7,9,1,false);
    g.addEdge(5,4,2,false);
    g.addEdge(5,2,3,false);
    g.addEdge(3,4,6,false);
    g.addEdge(4,2,5,false);
    g.addEdge(2,9,2,false);
    g.addEdge(9,8,4,false);
    g.prim();
    
}
}