corentinway / shortest-way Goto Github PK

var Node = require( 'shortest-way' ).Node;

// create nodes
var n1 = new Node( { id: 'n1' } );
var n2 = new Node( { id: 'n2' } );

var path = n1.compute(n2, [n1, n2]);
console.log(path.map(function (item,index) {return index + ': ' + item.id;}).join("\n"));

var Node = require( 'shortest-way' ).Node;

// create nodes 
var nodes = {
	startNode: new Node( { id: 'startNode' } ),
	middleNode1: new Node( { id: 'middleNode1' } ),
	middleNode2: new Node( { id: 'middleNode2' } ),
	middleNode3: new Node( { id: 'middleNode3' } ),
	endNode: new Node( { id: 'endNode' } )
};

// add relation
nodes.startNode.addNext(nodes.middleNode1, 1.9);
nodes.startNode.addNext(nodes.middleNode2, 1.7);
nodes.middleNode1.addNext(nodes.endNode, 1);
nodes.middleNode2.addNext(nodes.middleNode3, 0.01);
nodes.middleNode3.addNext(nodes.endNode, 1);

// Test 1: array!
console.log("from array\n=====================");
var pathFromArray = nodes.endNode.compute(nodes.startNode, [nodes.startNode, nodes.middleNode1, nodes.middleNode2, nodes.middleNode3, nodes.endNode]);
console.log(pathFromArray.map(function (item,index) {return index + ': ' + item.id;}).join("\n"));

// Test 2: object!
console.log("\nfrom object\n=====================");
var pathFromObject = nodes.endNode.compute(nodes.startNode, nodes);
console.log(pathFromObject.map(function (item,index) {return index + ': ' + item.id;}).join("\n"));