sankeyLayout.js 19.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements.  See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership.  The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License.  You may obtain a copy of the License at
*
*   http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied.  See the License for the
* specific language governing permissions and limitations
* under the License.
*/

20 21
/**
 * @file The layout algorithm of sankey view
22
 * @author Deqing Li(annong035@gmail.com)
23
 */
D
deqingli 已提交
24

S
sushuang 已提交
25
import * as layout from '../../util/layout';
S
sushuang 已提交
26
import * as zrUtil from 'zrender/src/core/util';
27
import {groupData} from '../../util/model';
28
import { __DEV__ } from '../../config';
D
deqingli 已提交
29

S
sushuang 已提交
30
export default function (ecModel, api, payload) {
D
deqingli 已提交
31

S
sushuang 已提交
32
    ecModel.eachSeriesByType('sankey', function (seriesModel) {
D
deqingli 已提交
33

S
sushuang 已提交
34 35
        var nodeWidth = seriesModel.get('nodeWidth');
        var nodeGap = seriesModel.get('nodeGap');
D
deqingli 已提交
36

S
sushuang 已提交
37
        var layoutInfo = getViewRect(seriesModel, api);
D
deqingli 已提交
38

S
sushuang 已提交
39
        seriesModel.layoutInfo = layoutInfo;
D
deqingli 已提交
40

S
sushuang 已提交
41 42
        var width = layoutInfo.width;
        var height = layoutInfo.height;
D
deqingli 已提交
43

S
sushuang 已提交
44
        var graph = seriesModel.getGraph();
D
deqingli 已提交
45

S
sushuang 已提交
46 47
        var nodes = graph.nodes;
        var edges = graph.edges;
D
deqingli 已提交
48

S
sushuang 已提交
49
        computeNodeValues(nodes);
D
deqingli 已提交
50

S
sushuang 已提交
51 52
        var filteredNodes = zrUtil.filter(nodes, function (node) {
            return node.getLayout().value === 0;
D
deqingli 已提交
53 54
        });

S
sushuang 已提交
55 56
        var iterations = filteredNodes.length !== 0
            ? 0 : seriesModel.get('layoutIterations');
D
deqingli 已提交
57

58 59
        var orient = seriesModel.get('orient');

60 61 62
        var nodeAlign = seriesModel.get('nodeAlign');

        layoutSankey(nodes, edges, nodeWidth, nodeGap, width, height, iterations, orient, nodeAlign);
S
sushuang 已提交
63 64
    });
}
D
deqingli 已提交
65

S
sushuang 已提交
66 67 68 69 70 71 72 73 74 75 76 77
/**
 * Get the layout position of the whole view
 *
 * @param {module:echarts/model/Series} seriesModel  the model object of sankey series
 * @param {module:echarts/ExtensionAPI} api  provide the API list that the developer can call
 * @return {module:zrender/core/BoundingRect}  size of rect to draw the sankey view
 */
function getViewRect(seriesModel, api) {
    return layout.getLayoutRect(
        seriesModel.getBoxLayoutParams(), {
            width: api.getWidth(),
            height: api.getHeight()
D
deqingli 已提交
78
        }
S
sushuang 已提交
79 80
    );
}
D
deqingli 已提交
81

82
function layoutSankey(nodes, edges, nodeWidth, nodeGap, width, height, iterations, orient, nodeAlign) {
D
deqingli 已提交
83
    computeNodeBreadths(nodes, edges, nodeWidth, width, height, orient, nodeAlign);
84 85
    computeNodeDepths(nodes, edges, height, width, nodeGap, iterations, orient);
    computeEdgeDepths(nodes, orient);
S
sushuang 已提交
86
}
D
deqingli 已提交
87

S
sushuang 已提交
88 89 90 91 92 93 94 95 96 97 98 99 100
/**
 * Compute the value of each node by summing the associated edge's value
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 */
function computeNodeValues(nodes) {
    zrUtil.each(nodes, function (node) {
        var value1 = sum(node.outEdges, getEdgeValue);
        var value2 = sum(node.inEdges, getEdgeValue);
        var value = Math.max(value1, value2);
        node.setLayout({value: value}, true);
    });
}
D
deqingli 已提交
101

S
sushuang 已提交
102
/**
103
 * Compute the x-position for each node.
104
 *
105 106
 * Here we use Kahn algorithm to detect cycle when we traverse
 * the node to computer the initial x position.
S
sushuang 已提交
107 108 109 110 111
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 * @param  {number} nodeWidth  the dx of the node
 * @param  {number} width  the whole width of the area to draw the view
 */
112
function computeNodeBreadths(nodes, edges, nodeWidth, width, height, orient, nodeAlign) {
113 114 115
    // Used to mark whether the edge is deleted. if it is deleted,
    // the value is 0, otherwise it is 1.
    var remainEdges = [];
116

117 118
    // Storage each node's indegree.
    var indegreeArr = [];
119

120 121
    //Used to storage the node with indegree is equal to 0.
    var zeroIndegrees = [];
122

123
    var nextTargetNode = [];
S
sushuang 已提交
124 125 126
    var x = 0;
    var kx = 0;

127 128 129 130
    for (var i = 0; i < edges.length; i++) {
        remainEdges[i] = 1;
    }

131
    for (i = 0; i < nodes.length; i++) {
132 133 134 135 136
        indegreeArr[i] = nodes[i].inEdges.length;
        if (indegreeArr[i] === 0) {
            zeroIndegrees.push(nodes[i]);
        }
    }
137

138
    while (zeroIndegrees.length) {
S
sushuang 已提交
139 140
        for (var idx = 0; idx < zeroIndegrees.length; idx++) {
            var node = zeroIndegrees[idx];
141 142 143 144 145 146 147 148
            if (orient === 'vertical') {
                node.setLayout({y: x}, true);
                node.setLayout({dy: nodeWidth}, true);
            }
            else {
                node.setLayout({x: x}, true);
                node.setLayout({dx: nodeWidth}, true);
            }
149 150
            for (var edgeIdx = 0; edgeIdx < node.outEdges.length; edgeIdx++) {
                var edge = node.outEdges[edgeIdx];
151 152
                var indexEdge = edges.indexOf(edge);
                remainEdges[indexEdge] = 0;
153
                var targetNode = edge.node2;
154
                var nodeIndex = nodes.indexOf(targetNode);
155 156
                if (--indegreeArr[nodeIndex] === 0 && nextTargetNode.indexOf(targetNode) < 0) {
                    nextTargetNode.push(targetNode);
157
                }
S
sushuang 已提交
158 159
            }
        }
S
sushuang 已提交
160
        ++x;
161 162
        zeroIndegrees = nextTargetNode;
        nextTargetNode = [];
D
deqingli 已提交
163
    }
164

165 166
    var nodesCopy = nodes.slice(0);

167
    for (i = 0; i < remainEdges.length; i++) {
168 169
        if (remainEdges[i] === 1) {
            if (__DEV__) {
170 171
                throw new Error('Sankey is a DAG, the original data has cycle!');
            }
172 173 174 175 176 177 178 179 180 181 182
            if (nodeAlign === 'right') {
                var edge = edges[i];
                var index1 = nodesCopy.indexOf(edge.node1);
                if (index1 > -1) {
                    nodesCopy.splice(index1, 1);
                }
                var index2 = nodesCopy.indexOf(edge.node2);
                if (index2 > -1) {
                    nodesCopy.splice(index2, 1);
                }
            }
183
        }
184
    }
185

186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
    if (nodeAlign === 'right') {
        var nextSourceNode = [];
        var remainNodes = nodesCopy;
        var nodeHeight = 0;
        while (remainNodes.length) {
            for (var i = 0; i < remainNodes.length; i++) {
                var node = remainNodes[i];
                node.setLayout({skNodeHeight: nodeHeight}, true);
                for (var j = 0; j < node.inEdges.length; j++) {
                    var edge = node.inEdges[j];
                    if (nextSourceNode.indexOf(edge.node1) < 0) {
                        nextSourceNode.push(edge.node1);
                    }
                }
            }
            remainNodes = nextSourceNode;
            nextSourceNode = [];
            ++nodeHeight;
        }

        zrUtil.each(nodesCopy, function (node) {
            if (orient === 'vertical') {
                node.setLayout({y: Math.max(0, x - 1 - node.getLayout().skNodeHeight)}, true);
            }
            else {
                node.setLayout({x: Math.max(0, x - 1 - node.getLayout().skNodeHeight)}, true);
            }
        });
    }

    if (nodeAlign === 'justify') {
217 218
        moveSinksRight(nodes, x, orient);
    }
D
deqingli 已提交
219

220 221 222 223 224 225 226
    var maxDepth = x - 1;
    zrUtil.each(nodesCopy, function (node) {
        var item = node.hostGraph.data.getRawDataItem(node.dataIndex);
        if (item.depth && !isNaN(item.depth) && item.depth >= 0) {
            if (item.depth > maxDepth) {
                maxDepth = item.depth;
            }
D
deqingli 已提交
227 228 229 230 231 232
            if (orient === 'vertical') {
                node.setLayout({y: item.depth}, true);
            }
            else {
                node.setLayout({x: item.depth}, true);
            }
233 234 235
        }
    });

236
    if (orient === 'vertical') {
237
        kx = (height - nodeWidth) / maxDepth;
238 239
    }
    else {
240
        kx = (width - nodeWidth) / maxDepth;
241
    }
242

D
deqingli 已提交
243
    scaleNodeBreadths(nodes, kx, orient);
S
sushuang 已提交
244
}
D
deqingli 已提交
245

S
sushuang 已提交
246 247 248 249 250 251 252 253
/**
 * All the node without outEgdes are assigned maximum x-position and
 *     be aligned in the last column.
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 * @param {number} x  value (x-1) use to assign to node without outEdges
 *     as x-position
 */
254
function moveSinksRight(nodes, x, orient) {
S
sushuang 已提交
255 256
    zrUtil.each(nodes, function (node) {
        if (!node.outEdges.length) {
257 258 259 260 261 262
            if (orient === 'vertical') {
                node.setLayout({y: x - 1}, true);
            }
            else {
                node.setLayout({x: x - 1}, true);
            }
D
deqingli 已提交
263
        }
S
sushuang 已提交
264 265
    });
}
D
deqingli 已提交
266

S
sushuang 已提交
267 268 269 270 271 272
/**
 * Scale node x-position to the width
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 * @param {number} kx   multiple used to scale nodes
 */
273
function scaleNodeBreadths(nodes, kx, orient) {
S
sushuang 已提交
274
    zrUtil.each(nodes, function (node) {
D
deqingli 已提交
275 276 277
        if (orient === 'vertical') {
            var nodeY = node.getLayout().y * kx;
            node.setLayout({y: nodeY}, true);
278 279
        }
        else {
D
deqingli 已提交
280 281
            var nodeX = node.getLayout().x * kx;
            node.setLayout({x: nodeX}, true);
282
        }
S
sushuang 已提交
283 284 285 286 287 288 289 290 291 292 293 294 295
    });
}

/**
 * Using Gauss-Seidel iterations method to compute the node depth(y-position)
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 * @param {module:echarts/data/Graph~Edge} edges  edge of sankey view
 * @param {number} height  the whole height of the area to draw the view
 * @param {number} nodeGap  the vertical distance between two nodes
 *     in the same column.
 * @param {number} iterations  the number of iterations for the algorithm
 */
296
function computeNodeDepths(nodes, edges, height, width, nodeGap, iterations, orient) {
297
    var nodesByBreadth = prepareNodesByBreadth(nodes, orient);
298

299 300
    initializeNodeDepth(nodes, nodesByBreadth, edges, height, width, nodeGap, orient);
    resolveCollisions(nodesByBreadth, nodeGap, height, width, orient);
S
sushuang 已提交
301 302 303 304 305

    for (var alpha = 1; iterations > 0; iterations--) {
        // 0.99 is a experience parameter, ensure that each iterations of
        // changes as small as possible.
        alpha *= 0.99;
306 307 308 309
        relaxRightToLeft(nodesByBreadth, alpha, orient);
        resolveCollisions(nodesByBreadth, nodeGap, height, width, orient);
        relaxLeftToRight(nodesByBreadth, alpha, orient);
        resolveCollisions(nodesByBreadth, nodeGap, height, width, orient);
S
sushuang 已提交
310 311 312
    }
}

313 314 315 316 317 318 319 320 321 322 323 324 325 326 327
function prepareNodesByBreadth(nodes, orient) {
    var nodesByBreadth = [];
    var keyAttr = orient === 'vertical' ? 'y' : 'x';

    var groupResult = groupData(nodes, function (node) {
        return node.getLayout()[keyAttr];
    });
    groupResult.keys.sort(function (a, b) {
        return a - b;
    });
    zrUtil.each(groupResult.keys, function (key) {
        nodesByBreadth.push(groupResult.buckets.get(key));
    });

    return nodesByBreadth;
328 329
}

S
sushuang 已提交
330 331 332 333 334 335 336 337 338 339
/**
 * Compute the original y-position for each node
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 * @param {Array.<Array.<module:echarts/data/Graph~Node>>} nodesByBreadth
 *     group by the array of all sankey nodes based on the nodes x-position.
 * @param {module:echarts/data/Graph~Edge} edges  edge of sankey view
 * @param {number} height  the whole height of the area to draw the view
 * @param {number} nodeGap  the vertical distance between two nodes
 */
340
function initializeNodeDepth(nodes, nodesByBreadth, edges, height, width, nodeGap, orient) {
S
sushuang 已提交
341 342 343 344
    var kyArray = [];
    zrUtil.each(nodesByBreadth, function (nodes) {
        var n = nodes.length;
        var sum = 0;
345
        var ky = 0;
S
sushuang 已提交
346 347
        zrUtil.each(nodes, function (node) {
            sum += node.getLayout().value;
D
deqingli 已提交
348
        });
349 350 351 352 353 354
        if (orient === 'vertical') {
            ky = (width - (n - 1) * nodeGap) / sum;
        }
        else {
            ky = (height - (n - 1) * nodeGap) / sum;
        }
S
sushuang 已提交
355 356 357 358 359 360 361 362 363 364 365
        kyArray.push(ky);
    });

    kyArray.sort(function (a, b) {
        return a - b;
    });
    var ky0 = kyArray[0];

    zrUtil.each(nodesByBreadth, function (nodes) {
        zrUtil.each(nodes, function (node, i) {
            var nodeDy = node.getLayout().value * ky0;
366 367 368 369 370 371 372 373 374
            if (orient === 'vertical') {
                node.setLayout({x: i}, true);
                node.setLayout({dx: nodeDy}, true);
            }
            else {
                node.setLayout({y: i}, true);
                node.setLayout({dy: nodeDy}, true);
            }

D
deqingli 已提交
375
        });
S
sushuang 已提交
376
    });
D
deqingli 已提交
377

S
sushuang 已提交
378 379 380 381 382 383 384 385 386 387 388 389 390 391
    zrUtil.each(edges, function (edge) {
        var edgeDy = +edge.getValue() * ky0;
        edge.setLayout({dy: edgeDy}, true);
    });
}

/**
 * Resolve the collision of initialized depth (y-position)
 *
 * @param {Array.<Array.<module:echarts/data/Graph~Node>>} nodesByBreadth
 *     group by the array of all sankey nodes based on the nodes x-position.
 * @param {number} nodeGap  the vertical distance between two nodes
 * @param {number} height  the whole height of the area to draw the view
 */
392
function resolveCollisions(nodesByBreadth, nodeGap, height, width, orient) {
S
sushuang 已提交
393 394 395 396 397 398 399
    zrUtil.each(nodesByBreadth, function (nodes) {
        var node;
        var dy;
        var y0 = 0;
        var n = nodes.length;
        var i;

400
        if (orient === 'vertical') {
S
sushuang 已提交
401
            var nodeX;
402 403 404 405 406 407 408
            nodes.sort(function (a, b) {
                return a.getLayout().x - b.getLayout().x;
            });
            for (i = 0; i < n; i++) {
                node = nodes[i];
                dy = y0 - node.getLayout().x;
                if (dy > 0) {
S
sushuang 已提交
409
                    nodeX = node.getLayout().x + dy;
410 411 412 413 414 415
                    node.setLayout({x: nodeX}, true);
                }
                y0 = node.getLayout().x + node.getLayout().dx + nodeGap;
            }
            // If the bottommost node goes outside the bounds, push it back up
            dy = y0 - nodeGap - width;
S
sushuang 已提交
416
            if (dy > 0) {
417 418 419 420 421 422 423 424 425 426 427 428
                nodeX = node.getLayout().x - dy;
                node.setLayout({x: nodeX}, true);
                y0 = nodeX;
                for (i = n - 2; i >= 0; --i) {
                    node = nodes[i];
                    dy = node.getLayout().x + node.getLayout().dx + nodeGap - y0;
                    if (dy > 0) {
                        nodeX = node.getLayout().x - dy;
                        node.setLayout({x: nodeX}, true);
                    }
                    y0 = node.getLayout().x;
                }
S
sushuang 已提交
429 430
            }
        }
431
        else {
S
sushuang 已提交
432
            var nodeY;
433 434 435 436
            nodes.sort(function (a, b) {
                return a.getLayout().y - b.getLayout().y;
            });
            for (i = 0; i < n; i++) {
D
deqingli 已提交
437
                node = nodes[i];
438
                dy = y0 - node.getLayout().y;
439
                if (dy > 0) {
S
sushuang 已提交
440
                    nodeY = node.getLayout().y + dy;
D
deqingli 已提交
441 442
                    node.setLayout({y: nodeY}, true);
                }
443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
                y0 = node.getLayout().y + node.getLayout().dy + nodeGap;
            }
            // If the bottommost node goes outside the bounds, push it back up
            dy = y0 - nodeGap - height;
            if (dy > 0) {
                nodeY = node.getLayout().y - dy;
                node.setLayout({y: nodeY}, true);
                y0 = nodeY;
                for (i = n - 2; i >= 0; --i) {
                    node = nodes[i];
                    dy = node.getLayout().y + node.getLayout().dy + nodeGap - y0;
                    if (dy > 0) {
                        nodeY = node.getLayout().y - dy;
                        node.setLayout({y: nodeY}, true);
                    }
                    y0 = node.getLayout().y;
                }
D
deqingli 已提交
460
            }
S
sushuang 已提交
461 462 463
        }
    });
}
D
deqingli 已提交
464

S
sushuang 已提交
465 466 467 468 469 470 471
/**
 * Change the y-position of the nodes, except most the right side nodes
 *
 * @param {Array.<Array.<module:echarts/data/Graph~Node>>} nodesByBreadth
 *     group by the array of all sankey nodes based on the node x-position.
 * @param {number} alpha  parameter used to adjust the nodes y-position
 */
472
function relaxRightToLeft(nodesByBreadth, alpha, orient) {
S
sushuang 已提交
473 474 475
    zrUtil.each(nodesByBreadth.slice().reverse(), function (nodes) {
        zrUtil.each(nodes, function (node) {
            if (node.outEdges.length) {
476 477 478 479 480 481 482 483 484
                var y = sum(node.outEdges, weightedTarget, orient) / sum(node.outEdges, getEdgeValue, orient);
                if (orient === 'vertical') {
                    var nodeX = node.getLayout().x + (y - center(node, orient)) * alpha;
                    node.setLayout({x: nodeX}, true);
                }
                else {
                    var nodeY = node.getLayout().y + (y - center(node, orient)) * alpha;
                    node.setLayout({y: nodeY}, true);
                }
L
lang 已提交
485
            }
D
deqingli 已提交
486
        });
S
sushuang 已提交
487 488
    });
}
D
deqingli 已提交
489

490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519
function weightedTarget(edge, orient) {
    return center(edge.node2, orient) * edge.getValue();
}

function weightedSource(edge, orient) {
    return center(edge.node1, orient) * edge.getValue();
}

function center(node, orient) {
    if (orient === 'vertical') {
        return node.getLayout().x + node.getLayout().dx / 2;
    }
    return node.getLayout().y + node.getLayout().dy / 2;
}

function getEdgeValue(edge) {
    return edge.getValue();
}

function sum(array, f, orient) {
    var sum = 0;
    var len = array.length;
    var i = -1;
    while (++i < len) {
        var value = +f.call(array, array[i], orient);
        if (!isNaN(value)) {
            sum += value;
        }
    }
    return sum;
S
sushuang 已提交
520
}
D
deqingli 已提交
521

S
sushuang 已提交
522 523 524 525 526 527 528
/**
 * Change the y-position of the nodes, except most the left side nodes
 *
 * @param {Array.<Array.<module:echarts/data/Graph~Node>>} nodesByBreadth
 *     group by the array of all sankey nodes based on the node x-position.
 * @param {number} alpha  parameter used to adjust the nodes y-position
 */
529
function relaxLeftToRight(nodesByBreadth, alpha, orient) {
S
sushuang 已提交
530 531 532
    zrUtil.each(nodesByBreadth, function (nodes) {
        zrUtil.each(nodes, function (node) {
            if (node.inEdges.length) {
533 534 535 536 537 538 539 540 541
                var y = sum(node.inEdges, weightedSource, orient) / sum(node.inEdges, getEdgeValue, orient);
                if (orient === 'vertical') {
                    var nodeX = node.getLayout().x + (y - center(node, orient)) * alpha;
                    node.setLayout({x: nodeX}, true);
                }
                else {
                    var nodeY = node.getLayout().y + (y - center(node, orient)) * alpha;
                    node.setLayout({y: nodeY}, true);
                }
S
sushuang 已提交
542
            }
D
deqingli 已提交
543
        });
S
sushuang 已提交
544 545
    });
}
D
deqingli 已提交
546

S
sushuang 已提交
547 548 549 550 551
/**
 * Compute the depth(y-position) of each edge
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 */
552
function computeEdgeDepths(nodes, orient) {
S
sushuang 已提交
553
    zrUtil.each(nodes, function (node) {
554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569
        if (orient === 'vertical') {
            node.outEdges.sort(function (a, b) {
                return a.node2.getLayout().x - b.node2.getLayout().x;
            });
            node.inEdges.sort(function (a, b) {
                return a.node1.getLayout().x - b.node1.getLayout().x;
            });
        }
        else {
            node.outEdges.sort(function (a, b) {
                return a.node2.getLayout().y - b.node2.getLayout().y;
            });
            node.inEdges.sort(function (a, b) {
                return a.node1.getLayout().y - b.node1.getLayout().y;
            });
        }
S
sushuang 已提交
570 571 572 573 574 575 576
    });
    zrUtil.each(nodes, function (node) {
        var sy = 0;
        var ty = 0;
        zrUtil.each(node.outEdges, function (edge) {
            edge.setLayout({sy: sy}, true);
            sy += edge.getLayout().dy;
D
deqingli 已提交
577
        });
S
sushuang 已提交
578 579 580
        zrUtil.each(node.inEdges, function (edge) {
            edge.setLayout({ty: ty}, true);
            ty += edge.getLayout().dy;
D
deqingli 已提交
581
        });
S
sushuang 已提交
582 583
    });
}