Last active
May 6, 2016 22:00
-
-
Save keithwhor/52a46f364c9a3cf75b12 to your computer and use it in GitHub Desktop.
Edge class for graphs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Edge extends Unit { | |
constructor(entity, properties) { | |
super(entity, properties); | |
this.inputNode = null; | |
this.outputNode = null; | |
this.duplex = false; | |
this.distance = 1; | |
} | |
// link a specific node in a certain direction | |
_linkTo(node, direction) { | |
if (direction <= 0) { | |
node.inputEdges.push(this); | |
} | |
if (direction >= 0) { | |
node.outputEdges.push(this); | |
} | |
node.edges.push(this); | |
return true; | |
} | |
// link two nodes, optionally make edge bidirectional (duplex) | |
link(inputNode, outputNode, duplex) { | |
this.unlink(); | |
this.inputNode = inputNode; | |
this.outputNode = outputNode; | |
this.duplex = !!duplex; | |
if (duplex) { | |
this._linkTo(inputNode, 0); | |
this._linkTo(outputNode, 0); | |
return this; | |
} | |
this._linkTo(inputNode, 1); | |
this._linkTo(outputNode, -1); | |
return this; | |
} | |
// distance for traversal | |
setDistance(v) { | |
this.distance = Math.abs(parseFloat(v) || 0); | |
return this; | |
} | |
// weight is 1 / distance | |
setWeight(v) { | |
this.distance = 1 / Math.abs(parseFloat(v) || 0); | |
return this; | |
} | |
// find the opposite node given a starting node | |
oppositeNode(node) { | |
if (this.inputNode === node) { | |
return this.outputNode; | |
} else if (this.outputNode === node) { | |
return this.inputNode; | |
} | |
return; | |
} | |
// unlink edge, remove connections from nodes | |
unlink() { | |
let pos; | |
let inode = this.inputNode; | |
let onode = this.outputNode; | |
if (!(inode && onode)) { | |
return; | |
} | |
(pos = inode.edges.indexOf(this)) > -1 && inode.edges.splice(pos, 1); | |
(pos = onode.edges.indexOf(this)) > -1 && onode.edges.splice(pos, 1); | |
(pos = inode.outputEdges.indexOf(this)) > -1 && inode.outputEdges.splice(pos, 1); | |
(pos = onode.inputEdges.indexOf(this)) > -1 && onode.inputEdges.splice(pos, 1); | |
if (this.duplex) { | |
(pos = inode.inputEdges.indexOf(this)) > -1 && inode.inputEdges.splice(pos, 1); | |
(pos = onode.outputEdges.indexOf(this)) > -1 && onode.outputEdges.splice(pos, 1); | |
} | |
this.inputNode = null; | |
this.outputNode = null; | |
this.duplex = false; | |
return true; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment