import java.util.*; public class Test1 { public static void main(String[] args) { Graph g = new MapGraph(); int i=0; g.addNode("a","A"); g.addNode("b","B"); g.addNode("c","C"); g.addNode("d","D"); g.addNode("e","E"); g.addNode("f","F"); g.addNode("g","G"); g.addNode("h","H"); g.addEdge("h","a",9); g.addEdge("a","b",7); g.addEdge("b","c",4); g.addEdge("c","d",8); g.addEdge("d","e",22); g.addEdge("e","f",9); g.addEdge("g","h",2); g.addEdge("g","b",4); g.addEdge("a","d",19); g.addEdge("h","d",3); System.out.println(g); System.out.println("Shortest path from a to d"); List nodesPath = AStar.findShortestPath(g.getNode("a"),g.getNode("d"),g); System.out.println(nodesPath); } }