1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
| Graph *graph = new Graph();
GraphNode *gnA = graph->addNode("A", 0.0, 0.0);
GraphNode *gnB = graph->addNode("B", 0.0, 0.0);
GraphNode *gnC = graph->addNode("C", 0.0, 0.0);
GraphNode *gnD = graph->addNode("D", 0.0, 0.0);
GraphNode *gnE = graph->addNode("E", 0.0, 0.0);
GraphNode *gnF = graph->addNode("F", 0.0, 0.0);
GraphNode *gnG = graph->addNode("G", 0.0, 0.0);
GraphConnection *gcA1 = graph->addConnection(1.3, gnA, gnB);
GraphConnection *gcA2 = graph->addConnection(1.1, gnA, gnC);
GraphConnection *gcB1 = graph->addConnection(1.5, gnB, gnD);
GraphConnection *gcB2 = graph->addConnection(1.7, gnB, gnE);
GraphConnection *gcC1 = graph->addConnection(1.5, gnC, gnE);
GraphConnection *gcC2 = graph->addConnection(1.6, gnC, gnF);
GraphConnection *gcE1 = graph->addConnection(1.5, gnE, gnG);
//create the AStarSearch class
AStarSearch *as = new AStarSearch();
//search the graph
as->doSearch(gnA, gnG);
as->doSearch(gnA, gnE);
//delete everything
delete as;
delete graph; |