Class: NodeGraph

rat. NodeGraph

new NodeGraph()

NodeGraph
Source:

Methods

checkIntersects(skipNodeopt)

// check if this line intersects with any existing links. // skipping a node is useful because we might be projecting a line from that node, // and this code will detect that as an intersect since one endpoint is the same. // But then I changed linesIntersect to ignore matching ends, so... forget that?
Parameters:
Name Type Attributes Description
skipNode number <optional>
optional node index to skip
Source:

checkLineNearNodes(skipNode1opt, skipNode2opt)

// // Check if this new proposed line runs close to existing nodes anywhere. // (except the given node) //
Parameters:
Name Type Attributes Description
skipNode1 number <optional>
skipNode2 number <optional>
Source: