LemonadeBaron/paths.js

 
var PathSet = function(options) {
	
	var defaults = {
		nodes: [],
		edges: Object.create(null), // indexed by "from" node
		
		
		nodeTypes: Object.create(null),
		nodeRefs: Object.create(null),
		
		nodeMatchEpsilon: .5,
	};
	
	var e = $.extend({}, defaults, options);
	for(x in e) this[x] = e[x];
	
	// shorthand
	this.c = this.components;
	
	
	this.init();
};



PathSet.prototype.init = function() {
	
	
	
};

// returns the new node id
PathSet.prototype.addNode = function(pos, type, ref) {
	
	var e = this.nodeMatchEpsilon;
	type = type || null;
	ref = ref || null;
	
	// look for an existing node that's close enough
	for(var i = 0; i < this.nodes.length; i++) {
		var n = this.nodes[i];
		if(pos.x + e >= n.x
			&& pos.x - e < n.x
			&& pos.y + e >= n.y
			&& pos.y - e < n.y) {
			
			// update the metadata
			if(null !== type) this.nodeTypes[i] = type;
			if(null !== ref) this.nodeRefs[i] = ref;
			
			return i;
		}
	}
	
	// no match has been found, insert a new one
	var ind = this.nodes.length;
	
	this.nodes.push(ptc(pos));
	this.edges[ind] = [];
	this.nodeTypes[ind] = type;
	this.nodeRefs[ind] = ref;
	
	return ind;
};


PathSet.prototype.addNodeIntoEdge = function(pos, type, ref) {
	
	var n = this.addNode(pos, type, ref);
	
	// check all paths
	
	
	
	
	
	
}



// adds an edge between two nodes 
PathSet.prototype.addEdge = function(from, to, bidirectional) {
	
	if(-1 === this.edges[from].indexOf(to))
		this.edges[from].push(to); 
	
	if(bidirectional && -1 === this.edges[to].indexOf(from))
		this.edges[to].push(from); 
	
};

// adds a path between two points
PathSet.prototype.addPath = function(from, to, bidirectional) {
	var f = this.addNode(from);
	var t = this.addNode(to);
	
	return this.addEdge(f, t, bidirectional);
};


PathSet.prototype.directConnected = function(from, to) {
	return this.edges[from].indexOf(to) !== -1;
}


PathSet.prototype.getNodeNear = function(pos, e) {
	
	e = e || this.nodeMatchEpsilon;
	
	// look for an existing node that's close enough
	for(var i = 0; i < this.nodes.length; i++) {
		var n = this.nodes[i];
		if(pos.x + e >= n.x
			&& pos.x - e < n.x
			&& pos.y + e >= n.y
			&& pos.y - e < n.y) {
			
			return i;
		}
	}
	
	return null;
};

PathSet.prototype.followRandomEdge = function(node) {
	
	var edges = this.edges[node];
	if(!edges) return null; // bad node or no exits
	
	var i = rand(0, edges.length - 1);
	
	return ptc(this.nodes[edges[i]]);
};


PathSet.prototype.followTowardsDrink = function(node) {
	
	var edges = this.edges[node];
	if(!edges) return null; // bad node or no exits
	
	var i = rand(0, edges.length - 1);
	
	return ptc(this.nodes[edges[i]]);
};