import java.util.*;
class Test{
	public static void main(String[]args){
		Graph<City> g = new ListGraph<City>();
		
		City Kista = new City("Kista");
		g.addNode(Kista);
		City Husby = new City("Husby");
		g.addNode(Husby);
		City Akalla = new City("Akalla");
		g.addNode(Akalla);
		City Solna = new City("Solna");
		g.addNode(Solna);
		City Rinkeby = new City("Rinkeby");
		g.addNode(Rinkeby);
		City Tensta = new City("Tensta");
		g.addNode(Tensta);
		City Libanon = new City("Libanon");
		g.addNode(Libanon);
		
		g.connect(Kista, Husby, "T-Bana", 3);
		g.connect(Kista, Rinkeby, "Buss", 11);
		g.connect(Kista, Tensta, "Teleporter", 5);
		g.connect(Husby, Rinkeby, "Buss", 7);
		g.connect(Husby, Akalla, "T-Bana", 12);
		g.connect(Tensta, Solna, "Helikopter", 2);
		g.connect(Rinkeby, Akalla, "Buss", 12);
		g.connect(Rinkeby, Solna, "Superman", 7);
		g.connect(Akalla, Libanon, "Kamel", 1);
		g.connect(Akalla, Solna, "Buss", 6);
		g.connect(Solna, Libanon, "Flyg", 15);

		System.out.println(g);
		int skoj = g.getEdgeWeight(Kista,Rinkeby);
		System.out.println(skoj);
		if(GraphMethods.pathExists(g, Kista, Libanon)){
			System.out.println("yeeeees");
		}else{
			System.out.println("hells no");
		}
		//g.setEdgeWeight(Tensta,Kista,20);
		//System.out.print(g);
	
	
		Graph<NodeTest> nG = new ListGraph<NodeTest>();
		NodeTest n1 = new NodeTest("tree",233);
		nG.addNode(n1);
		NodeTest n2 = new NodeTest("bush",133);
		nG.addNode(n2);
		NodeTest n3 = new NodeTest("tree",55);
		nG.addNode(n3);
		nG.connect(n1, n2,"Walk", 100);
		nG.connect(n2,n3, "Walk", 78);
		nG.connect(n3,n1, "Tele", 77);
	}
}