var PF = require("pathfinding");
https://github.com/qiao/PathFinding.js/Here it is. You can just go into your package lib directory, clone it with git (or download and unzip it) and do Code: (javascript) [Select]var PF = require("pathfinding");http://qiao.github.io/PathFinding.js/visual/Here's an in-browser demonstration.
Thanks for all of the replies, sorry for the slow turn around, life got in the way.I've now scripted Dijkstra's Algorithm and it's working nicely, the key thing that Breadth First can't do as far as I understand that Dijkstra could do is have different movement costs for different nodes and ultimately find the cheapest route to each point - a feature I wanted.