This framework solves problems by searching. It provides you a collection of algorithms to do so.
/* initiate the mesh holder */
var mh = new meshHolder();
/* add some nodes */
var augsburg = mh.addNode('Augsburg', 10.897789999999986, 48.37054490000000);
var berlin = mh.addNode('Berlin', 13.404953999999975, 52.52000659999999);
var bonn = mh.addNode('Bonn', 7.098206800000071, 50.73743000000000);
var braunschweig = mh.addNode('Braunschweig', 10.526769599999966, 52.26887360000000);
var bremen = mh.addNode('Bremen', 8.801693600000021, 53.07929619999999);
var dresden = mh.addNode('Dresden', 13.737262099999953, 51.05040880000001);
var frankfurt = mh.addNode('Frankfurt', 8.682126700000026, 50.11092209999999);
var hamburg = mh.addNode('Hamburg', 9.993681899999956, 53.55108460000000);
var kiel = mh.addNode('Kiel', 10.122765100000038, 54.32329270000000);
var koeln = mh.addNode('Köln', 6.960278600000038, 50.93753100000000);
var leipzig = mh.addNode('Leipzig', 12.373074699999961, 51.33969550000000);
var magdeburg = mh.addNode('Magdeburg', 11.627623699999958, 52.12053330000000);
var muenchen = mh.addNode('München', 11.581980499999986, 48.13512530000000);
var potsdam = mh.addNode('Potsdam', 13.064472900000055, 52.39056890000000);
var rostock = mh.addNode('Rostock', 12.099146600000040, 54.09244060000000);
var stuttgart = mh.addNode('Stuttgart', 9.182932100000016, 48.77584590000000);
/* add some connections (with the costs) */
mh.addConnection(dresden, leipzig, {cost: 120});
mh.addConnection(dresden, muenchen, {cost: 459});
mh.addConnection(dresden, stuttgart, {cost: 507});
mh.addConnection(dresden, berlin, {cost: 193});
mh.addConnection(leipzig, berlin, {cost: 190});
mh.addConnection(leipzig, magdeburg, {cost: 127});
mh.addConnection(leipzig, frankfurt, {cost: 391});
mh.addConnection(leipzig, koeln, {cost: 505});
mh.addConnection(berlin, rostock, {cost: 234});
mh.addConnection(berlin, braunschweig, {cost: 235});
mh.addConnection(berlin, potsdam, {cost: 35});
mh.addConnection(magdeburg, braunschweig, {cost: 99});
mh.addConnection(magdeburg, rostock, {cost: 298});
mh.addConnection(braunschweig, hamburg, {cost: 185});
mh.addConnection(braunschweig, augsburg, {cost: 588});
mh.addConnection(braunschweig, koeln, {cost: 363});
mh.addConnection(rostock, hamburg, {cost: 184});
mh.addConnection(rostock, kiel, {cost: 202});
mh.addConnection(hamburg, bremen, {cost: 126});
mh.addConnection(hamburg, kiel, {cost: 88});
mh.addConnection(hamburg, potsdam, {cost: 288});
mh.addConnection(bremen, frankfurt, {cost: 442});
mh.addConnection(bremen, koeln, {cost: 321});
mh.addConnection(bremen, augsburg, {cost: 722});
mh.addConnection(bremen, kiel, {cost: 207});
mh.addConnection(muenchen, augsburg, {cost: 80});
mh.addConnection(augsburg, stuttgart, {cost: 164});
mh.addConnection(stuttgart, frankfurt, {cost: 210});
mh.addConnection(frankfurt, bonn, {cost: 173});
mh.addConnection(bonn, koeln, {cost: 34});Calculate the shortes way from Munich to Rostock:
/* initialize the breadth first search class */
var as = new breadthFirstSearch(mh);
/* it is a breadth first search - we only need a cost function to solve this problem */
as.addCostFunction(function (currentNode, nextNode, targetNode, connection) {
return connection.cost;
});
/* do all the calculation stuff */
var tree = as.calculateTree(muenchen, rostock);
var optimalWay = as.getOptimalWay(tree, targetNode);
/* prints the result out */
console.log(optimalWay);The output of console.log looks like this:
0: {name: "München", x: 11.581980499999986, y: 48.1351253}
1: {name: "Dresden", x: 13.737262099999953, y: 51.05040880000001}
2: {name: "Berlin", x: 13.404953999999975, y: 52.52000659999999}
3: {name: "Rostock", x: 12.09914660000004, y: 54.0924406}You can find the demo from the example above here: demo/breadth-first-search.html It prints out the following output that shows the graphical result with the optimal way and all used connections to calculate it:
Calculate the shortes way from Munich to Rostock:
/* initialize the breadth first search class */
var as = new greedySearch(mh);
/* it is a breadth first search - we only need a cost function to solve this problem */
as.addHeuristicFunction(function (currentNode, nextNode, targetNode, connection) {
return distance.fromLatLonInKm(currentNode.x, currentNode.y, targetNode.x, targetNode.y);
});
/* do all the calculation stuff */
var tree = as.calculateTree(muenchen, rostock);
var optimalWay = as.getOptimalWay(tree, targetNode);
/* prints the result out */
console.log(optimalWay);The output of console.log looks like this:
0: {name: "München", x: 11.581980499999986, y: 48.1351253}
1: {name: "Dresden", x: 13.737262099999953, y: 51.05040880000001}
2: {name: "Berlin", x: 13.404953999999975, y: 52.52000659999999}
3: {name: "Rostock", x: 12.09914660000004, y: 54.0924406}You can find the demo from the example above here: demo/greedy-search.html It prints out the following output that shows the graphical result with the optimal way and all used connections to calculate it:
Calculate the shortes way from Munich to Rostock:
/* initialize the breadth first search class */
var as = new breadthFirstSearch(mh);
/* it is a breadth first search - we only need a cost function to solve this problem */
as.addCostFunction(function (currentNode, nextNode, targetNode, connection) {
return connection.cost;
});
as.addHeuristicFunction(function (currentNode, nextNode, targetNode, connection) {
return distance.fromLatLonInKm(currentNode.x, currentNode.y, targetNode.x, targetNode.y);
});
/* do all the calculation stuff */
var tree = as.calculateTree(muenchen, rostock);
var optimalWay = as.getOptimalWay(tree, targetNode);
/* prints the result out */
console.log(optimalWay);The output of console.log looks like this:
0: {name: "München", x: 11.581980499999986, y: 48.1351253}
1: {name: "Dresden", x: 13.737262099999953, y: 51.05040880000001}
2: {name: "Berlin", x: 13.404953999999975, y: 52.52000659999999}
3: {name: "Rostock", x: 12.09914660000004, y: 54.0924406}You can find the demo from the example above here: demo/a-star-search.html It prints out the following output that shows the graphical result with the optimal way and all used connections to calculate it:
