2019-07-03 03:36:48 +00:00
|
|
|
class Layout {
|
|
|
|
|
constructor(graph) {
|
|
|
|
|
this.graph_ = graph;
|
|
|
|
|
|
2019-07-03 19:33:10 +00:00
|
|
|
this.nodes_ = [];
|
2019-07-03 18:13:11 +00:00
|
|
|
this.nodesByPos_ = new Map();
|
|
|
|
|
this.nodesByGraphNode_ = new Map();
|
2019-07-05 04:59:04 +00:00
|
|
|
this.lineSteps_ = [];
|
2019-07-03 18:13:11 +00:00
|
|
|
|
2019-07-03 03:36:48 +00:00
|
|
|
this.setInitialPositions();
|
2019-07-03 18:13:11 +00:00
|
|
|
this.resolveAffinity();
|
|
|
|
|
this.resolveGroups();
|
|
|
|
|
while (this.iterate());
|
2019-07-05 04:59:04 +00:00
|
|
|
this.drawLines();
|
2019-07-03 18:13:11 +00:00
|
|
|
this.fixOrigin();
|
2019-07-03 03:36:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
setInitialPositions() {
|
|
|
|
|
const SPACING = 4;
|
|
|
|
|
|
|
|
|
|
let maxRankNodes = 0;
|
|
|
|
|
for (let nodes of this.graph_.nodesByPageRank.values()) {
|
|
|
|
|
maxRankNodes = Math.max(maxRankNodes, nodes.length);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
let ranks = Array.from(this.graph_.nodesByPageRank.keys());
|
|
|
|
|
ranks.sort((a, b) => a - b);
|
|
|
|
|
for (let r = 0; r < ranks.length; ++r) {
|
|
|
|
|
let nodes = this.graph_.nodesByPageRank.get(ranks[r]);
|
|
|
|
|
for (let n = 0; n < nodes.length; ++n) {
|
|
|
|
|
let node = nodes[n];
|
|
|
|
|
let pos = [
|
|
|
|
|
r * SPACING,
|
|
|
|
|
Math.floor((nodes.length / 2) * SPACING) + (n * SPACING) +
|
|
|
|
|
(node.subgraph * SPACING * maxRankNodes),
|
|
|
|
|
];
|
2019-07-03 19:33:10 +00:00
|
|
|
let layoutNode = new LayoutNode(node, this.nodesByPos_, pos);
|
|
|
|
|
this.nodes_.push(layoutNode);
|
|
|
|
|
this.nodesByGraphNode_.set(node, layoutNode);
|
2019-07-03 18:13:11 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
nodesFromGraphNodes(graphNodes) {
|
|
|
|
|
let nodes = [];
|
|
|
|
|
for (let graphNode of graphNodes) {
|
|
|
|
|
nodes.push(this.nodesByGraphNode_.get(graphNode));
|
|
|
|
|
}
|
|
|
|
|
return nodes;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
resolveGroups() {
|
|
|
|
|
this.groups_ = [];
|
|
|
|
|
for (let group of this.graph_.groups) {
|
|
|
|
|
let nodes = this.nodesFromGraphNodes(group.nodes);
|
2019-07-05 06:10:41 +00:00
|
|
|
this.groups_.push(new LayoutGroup(group, this.nodesByPos_, nodes));
|
2019-07-03 18:13:11 +00:00
|
|
|
}
|
|
|
|
|
for (let subgraph of this.graph_.nodesBySubgraph.values()) {
|
|
|
|
|
let nodes = this.nodesFromGraphNodes(subgraph);
|
2019-07-05 06:10:41 +00:00
|
|
|
this.groups_.push(new LayoutGroup(null, this.nodesByPos_, nodes));
|
2019-07-03 18:13:11 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
resolveAffinity() {
|
|
|
|
|
for (let node of this.nodesByGraphNode_.values()) {
|
|
|
|
|
node.resolveAffinity(this.nodesByGraphNode_);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
iterate() {
|
2019-07-03 19:33:10 +00:00
|
|
|
let objects = Array.from(this.nodes_);
|
2019-07-03 18:13:11 +00:00
|
|
|
this.setTension(objects);
|
|
|
|
|
this.sortByMostTension(objects);
|
2019-07-03 20:00:05 +00:00
|
|
|
for (let group of this.groups_) {
|
|
|
|
|
// Groups go in the list after nodes, and nodes must have tension set
|
|
|
|
|
// properly first.
|
|
|
|
|
group.setTension();
|
|
|
|
|
objects.push(group);
|
|
|
|
|
}
|
2019-07-03 18:13:11 +00:00
|
|
|
|
|
|
|
|
let newOffset = null;
|
|
|
|
|
let newTension = this.getTotalTension(objects);
|
|
|
|
|
for (let obj of objects) {
|
|
|
|
|
let offsets = new Map();
|
|
|
|
|
let addOffset = (x, y) => {
|
|
|
|
|
if (x == 0 && y == 0) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
offsets.set([x, y].toString(), [x, y]);
|
|
|
|
|
};
|
|
|
|
|
for (let dir of [-1, 0, 1]) {
|
|
|
|
|
addOffset(Math.sign(obj.vec[0]), dir);
|
|
|
|
|
addOffset(dir, Math.sign(obj.vec[1]));
|
|
|
|
|
}
|
|
|
|
|
for (let offset of offsets.values()) {
|
|
|
|
|
if (obj.offsetCollides(offset)) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
obj.savePos();
|
2019-07-05 05:51:45 +00:00
|
|
|
let nodesByPos = Array.from(this.nodesByPos_);
|
2019-07-03 18:13:11 +00:00
|
|
|
obj.moveBy(offset);
|
2019-07-03 18:35:24 +00:00
|
|
|
this.setTension(objects);
|
2019-07-03 18:13:11 +00:00
|
|
|
let testTension = this.getTotalTension(objects);
|
|
|
|
|
obj.restorePos();
|
2019-07-05 05:50:03 +00:00
|
|
|
this.nodesByPos_.clear();
|
|
|
|
|
for (let [k, v] of nodesByPos) {
|
|
|
|
|
this.nodesByPos_.set(k, v);
|
|
|
|
|
}
|
2019-07-03 18:13:11 +00:00
|
|
|
if (testTension < newTension) {
|
|
|
|
|
newOffset = offset;
|
|
|
|
|
newTension = testTension;
|
|
|
|
|
}
|
2019-07-03 03:36:48 +00:00
|
|
|
}
|
2019-07-03 18:13:11 +00:00
|
|
|
if (newOffset) {
|
|
|
|
|
obj.moveBy(newOffset);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
setTension(objects) {
|
|
|
|
|
for (let obj of objects) {
|
|
|
|
|
obj.setTension();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sortByMostTension(objects) {
|
|
|
|
|
objects.sort((a, b) => b.tension - a.tension);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
getTotalTension(objects) {
|
|
|
|
|
let total = 0;
|
|
|
|
|
for (let obj of objects) {
|
|
|
|
|
total += obj.tension;
|
2019-07-03 03:36:48 +00:00
|
|
|
}
|
2019-07-03 18:13:11 +00:00
|
|
|
return total;
|
2019-07-03 03:36:48 +00:00
|
|
|
}
|
|
|
|
|
|
2019-07-03 18:13:11 +00:00
|
|
|
fixOrigin() {
|
|
|
|
|
let min = [Number.MAX_SAFE_INTEGER, Number.MAX_SAFE_INTEGER];
|
|
|
|
|
let max = [Number.MIN_SAFE_INTEGER, Number.MIN_SAFE_INTEGER];
|
2019-07-04 06:42:05 +00:00
|
|
|
for (let group of this.groups_) {
|
|
|
|
|
let [groupMin, groupMax] = group.getMinMax();
|
2019-07-03 18:13:11 +00:00
|
|
|
for (let i of [0, 1]) {
|
2019-07-04 06:42:05 +00:00
|
|
|
min[i] = Math.min(min[i], groupMin[i]);
|
|
|
|
|
max[i] = Math.max(max[i], groupMax[i]);
|
2019-07-03 18:13:11 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// Offset is negative minimum, e.g min -1 means +1 to all values
|
2019-07-03 19:33:10 +00:00
|
|
|
for (let node of this.nodes_) {
|
2019-07-03 18:13:11 +00:00
|
|
|
for (let i of [0, 1]) {
|
|
|
|
|
node.pos[i] -= min[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-07-05 04:59:04 +00:00
|
|
|
for (let lineStep of this.lineSteps_) {
|
|
|
|
|
for (let i of [0, 1]) {
|
|
|
|
|
lineStep.pos[i] -= min[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-07-03 18:13:11 +00:00
|
|
|
this.size = [
|
|
|
|
|
max[0] - min[0] + 1,
|
|
|
|
|
max[1] - min[1] + 1,
|
|
|
|
|
];
|
2019-07-03 03:36:48 +00:00
|
|
|
}
|
2019-07-03 18:27:32 +00:00
|
|
|
|
2019-07-05 04:59:04 +00:00
|
|
|
drawLines() {
|
|
|
|
|
for (let link of this.graph_.links) {
|
|
|
|
|
for (let from of link.from) {
|
|
|
|
|
for (let to of link.to) {
|
|
|
|
|
this.drawLine(
|
|
|
|
|
this.nodesByGraphNode_.get(from),
|
|
|
|
|
this.nodesByGraphNode_.get(to));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Mapping to lines.svg clock-style numbering
|
|
|
|
|
outPointLookup = new Map([
|
|
|
|
|
['0,-1', 0],
|
|
|
|
|
['1,-1', 1],
|
|
|
|
|
['1,0', 2],
|
|
|
|
|
['1,1', 3],
|
|
|
|
|
['0,1', 4],
|
|
|
|
|
['-1,1', 5],
|
|
|
|
|
['-1,0', 6],
|
|
|
|
|
['-1,-1', 7],
|
|
|
|
|
]);
|
|
|
|
|
|
|
|
|
|
drawLine(from, to) {
|
|
|
|
|
let pos = Array.from(from.pos);
|
|
|
|
|
let inPoint = null;
|
|
|
|
|
while (true) {
|
|
|
|
|
let offset = [];
|
|
|
|
|
for (let i of [0, 1]) {
|
|
|
|
|
offset[i] = Math.sign(to.pos[i] - pos[i]);
|
|
|
|
|
}
|
|
|
|
|
let outPoint = this.outPointLookup.get(offset.toString());
|
|
|
|
|
if (inPoint === null) {
|
|
|
|
|
this.lineSteps_.push({
|
|
|
|
|
type: 'line',
|
|
|
|
|
pos: Array.from(pos),
|
|
|
|
|
cls: 's' + outPoint,
|
|
|
|
|
});
|
|
|
|
|
} else {
|
|
|
|
|
if (offset[0] == 0 && offset[1] == 0) {
|
|
|
|
|
// Reached destination
|
|
|
|
|
this.lineSteps_.push({
|
|
|
|
|
type: 'line',
|
|
|
|
|
pos: Array.from(pos),
|
|
|
|
|
cls: 's' + inPoint,
|
|
|
|
|
});
|
|
|
|
|
break;
|
|
|
|
|
} else {
|
|
|
|
|
this.lineSteps_.push({
|
|
|
|
|
type: 'line',
|
|
|
|
|
pos: Array.from(pos),
|
|
|
|
|
cls: 'i' + inPoint + 'o' + outPoint,
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// Set values for the next loop
|
|
|
|
|
inPoint = (outPoint + 4) % 8;
|
|
|
|
|
for (let i of [0, 1]) {
|
|
|
|
|
pos[i] += offset[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-07-03 18:27:32 +00:00
|
|
|
getDrawSteps() {
|
|
|
|
|
let steps = [
|
|
|
|
|
{
|
|
|
|
|
type: 'size',
|
|
|
|
|
size: this.size,
|
|
|
|
|
},
|
|
|
|
|
];
|
|
|
|
|
|
2019-07-03 19:33:10 +00:00
|
|
|
let nodes = Array.from(this.nodes_);
|
2019-07-03 18:27:32 +00:00
|
|
|
for (let i of [1, 0]) {
|
|
|
|
|
nodes.sort((a, b) => a.pos[i] - b.pos[i]);
|
|
|
|
|
}
|
|
|
|
|
for (let node of nodes) {
|
2019-07-04 06:42:05 +00:00
|
|
|
steps.push(node.getStep());
|
|
|
|
|
}
|
|
|
|
|
for (let group of this.groups_) {
|
|
|
|
|
let step = group.getStep();
|
|
|
|
|
if (step) {
|
|
|
|
|
steps.push(step);
|
|
|
|
|
}
|
2019-07-03 18:27:32 +00:00
|
|
|
}
|
2019-07-05 04:59:04 +00:00
|
|
|
steps.push(...this.lineSteps_);
|
2019-07-03 18:27:32 +00:00
|
|
|
|
|
|
|
|
return steps;
|
|
|
|
|
}
|
2019-07-03 03:36:48 +00:00
|
|
|
}
|
2019-07-03 18:13:11 +00:00
|
|
|
|
|
|
|
|
<!--# include file="LayoutGroup.js" -->
|
|
|
|
|
<!--# include file="LayoutNode.js" -->
|