sankeyLayout.js 12.3 KB
Newer Older
1 2 3 4
/**
 * @file The layout algorithm of sankey view
 * @author  Deqing Li(annong035@gmail.com)
 */
D
deqingli 已提交
5

S
sushuang 已提交
6
import * as layout from '../../util/layout';
S
sushuang 已提交
7
import nest from '../../util/array/nest';
S
sushuang 已提交
8
import * as zrUtil from 'zrender/src/core/util';
9
import { __DEV__ } from '../../config';
D
deqingli 已提交
10

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

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

S
sushuang 已提交
15 16
        var nodeWidth = seriesModel.get('nodeWidth');
        var nodeGap = seriesModel.get('nodeGap');
D
deqingli 已提交
17

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

S
sushuang 已提交
20
        seriesModel.layoutInfo = layoutInfo;
D
deqingli 已提交
21

S
sushuang 已提交
22 23
        var width = layoutInfo.width;
        var height = layoutInfo.height;
D
deqingli 已提交
24

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

S
sushuang 已提交
27 28
        var nodes = graph.nodes;
        var edges = graph.edges;
D
deqingli 已提交
29

S
sushuang 已提交
30
        computeNodeValues(nodes);
D
deqingli 已提交
31

S
sushuang 已提交
32 33
        var filteredNodes = zrUtil.filter(nodes, function (node) {
            return node.getLayout().value === 0;
D
deqingli 已提交
34 35
        });

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

S
sushuang 已提交
39 40 41
        layoutSankey(nodes, edges, nodeWidth, nodeGap, width, height, iterations);
    });
}
D
deqingli 已提交
42

S
sushuang 已提交
43 44 45 46 47 48 49 50 51 52 53 54
/**
 * 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 已提交
55
        }
S
sushuang 已提交
56 57
    );
}
D
deqingli 已提交
58

S
sushuang 已提交
59
function layoutSankey(nodes, edges, nodeWidth, nodeGap, width, height, iterations) {
60
    computeNodeBreadths(nodes, edges, nodeWidth, width);
S
sushuang 已提交
61 62 63
    computeNodeDepths(nodes, edges, height, nodeGap, iterations);
    computeEdgeDepths(nodes);
}
D
deqingli 已提交
64

S
sushuang 已提交
65 66 67 68 69 70 71 72 73 74 75 76 77
/**
 * 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 已提交
78

S
sushuang 已提交
79
/**
80 81 82 83
 * Compute the x-position for each node.
 * 
 * Here we use Kahn algorithm to detect cycle when we traverse
 * the node to computer the initial x position.
S
sushuang 已提交
84 85 86 87 88
 *
 * @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
 */
89 90 91 92 93 94 95 96
function computeNodeBreadths(nodes, edges, nodeWidth, width) {
    // Used to mark whether the edge is deleted. if it is deleted,
    // the value is 0, otherwise it is 1.
    var remainEdges = [];
    // Storage each node's indegree.
    var indegreeArr = [];
    //Used to storage the node with indegree is equal to 0.
    var zeroIndegrees = [];
97
    var nextNode = [];
S
sushuang 已提交
98 99 100
    var x = 0;
    var kx = 0;

101 102 103 104 105 106 107 108 109 110 111 112 113
    for (var i = 0; i < edges.length; i++) {
        remainEdges[i] = 1;
    }

    for (var i = 0; i < nodes.length; i++) {
        indegreeArr[i] = nodes[i].inEdges.length;
        if (indegreeArr[i] === 0) {
            zeroIndegrees.push(nodes[i]);
        }
    }
    
    while (zeroIndegrees.length) {
        zrUtil.each(zeroIndegrees, function (node) {
S
sushuang 已提交
114 115
            node.setLayout({x: x}, true);
            node.setLayout({dx: nodeWidth}, true);
116
            zrUtil.each(node.outEdges, function (edge) {
117 118
                var indexEdge = edges.indexOf(edge);
                remainEdges[indexEdge] = 0;
119
                var targetNode = edge.node2;
120 121
                var nodeIndex = nodes.indexOf(targetNode);
                if (--indegreeArr[nodeIndex] === 0) {
122 123 124 125
                    nextNode.push(targetNode);
                }
            });
        });
126
       
S
sushuang 已提交
127
        ++x;
128
        zeroIndegrees = nextNode;
129
        nextNode = [];
D
deqingli 已提交
130
    }
131 132
    
    for (var i = 0; i < remainEdges.length; i++) {
133 134 135 136 137
        if (__DEV__) {
            if (remainEdges[i] === 1) {
                throw new Error('Sankey is a DAG, the original data has cycle!');
            }
        } 
138
    }
139

140
    moveSinksRight(nodes, x);
S
sushuang 已提交
141
    kx = (width - nodeWidth) / (x - 1);
D
deqingli 已提交
142

S
sushuang 已提交
143 144
    scaleNodeBreadths(nodes, kx);
}
D
deqingli 已提交
145

S
sushuang 已提交
146 147 148 149 150 151 152 153 154 155 156 157
/**
 * 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
 */
function moveSinksRight(nodes, x) {
    zrUtil.each(nodes, function (node) {
        if (!node.outEdges.length) {
            node.setLayout({x: x - 1}, true);
D
deqingli 已提交
158
        }
S
sushuang 已提交
159 160
    });
}
D
deqingli 已提交
161

S
sushuang 已提交
162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193
/**
 * 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
 */
function scaleNodeBreadths(nodes, kx) {
    zrUtil.each(nodes, function (node) {
        var nodeX = node.getLayout().x * kx;
        node.setLayout({x: nodeX}, true);
    });
}

/**
 * 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
 */
function computeNodeDepths(nodes, edges, height, nodeGap, iterations) {
    var nodesByBreadth = nest()
        .key(function (d) {
            return d.getLayout().x;
        })
        .sortKeys(ascending)
        .entries(nodes)
        .map(function (d) {
            return d.values;
D
deqingli 已提交
194
        });
195

S
sushuang 已提交
196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226
    initializeNodeDepth(nodes, nodesByBreadth, edges, height, nodeGap);
    resolveCollisions(nodesByBreadth, nodeGap, height);

    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;
        relaxRightToLeft(nodesByBreadth, alpha);
        resolveCollisions(nodesByBreadth, nodeGap, height);
        relaxLeftToRight(nodesByBreadth, alpha);
        resolveCollisions(nodesByBreadth, nodeGap, height);
    }
}

/**
 * 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
 */
function initializeNodeDepth(nodes, nodesByBreadth, edges, height, nodeGap) {
    var kyArray = [];
    zrUtil.each(nodesByBreadth, function (nodes) {
        var n = nodes.length;
        var sum = 0;
        zrUtil.each(nodes, function (node) {
            sum += node.getLayout().value;
D
deqingli 已提交
227
        });
S
sushuang 已提交
228 229 230 231 232 233 234 235 236 237 238 239 240 241
        var ky = (height - (n - 1) * nodeGap) / sum;
        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) {
            node.setLayout({y: i}, true);
            var nodeDy = node.getLayout().value * ky0;
            node.setLayout({dy: nodeDy}, true);
D
deqingli 已提交
242
        });
S
sushuang 已提交
243
    });
D
deqingli 已提交
244

S
sushuang 已提交
245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277
    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
 */
function resolveCollisions(nodesByBreadth, nodeGap, height) {
    zrUtil.each(nodesByBreadth, function (nodes) {
        var node;
        var dy;
        var y0 = 0;
        var n = nodes.length;
        var i;

        nodes.sort(ascendingDepth);

        for (i = 0; i < n; i++) {
            node = nodes[i];
            dy = y0 - node.getLayout().y;
            if (dy > 0) {
                var nodeY = node.getLayout().y + dy;
                node.setLayout({y: nodeY}, true);
            }
            y0 = node.getLayout().y + node.getLayout().dy + nodeGap;
        }
D
deqingli 已提交
278

279
        // If the bottommost node goes outside the bounds, push it back up
S
sushuang 已提交
280 281 282 283 284 285
        dy = y0 - nodeGap - height;
        if (dy > 0) {
            var nodeY = node.getLayout().y - dy;
            node.setLayout({y: nodeY}, true);
            y0 = node.getLayout().y;
            for (i = n - 2; i >= 0; --i) {
D
deqingli 已提交
286
                node = nodes[i];
S
sushuang 已提交
287
                dy = node.getLayout().y + node.getLayout().dy + nodeGap - y0;
288
                if (dy > 0) {
S
sushuang 已提交
289
                    nodeY = node.getLayout().y - dy;
D
deqingli 已提交
290 291
                    node.setLayout({y: nodeY}, true);
                }
S
sushuang 已提交
292
                y0 = node.getLayout().y;
D
deqingli 已提交
293
            }
S
sushuang 已提交
294 295 296
        }
    });
}
D
deqingli 已提交
297

S
sushuang 已提交
298 299 300 301 302 303 304 305 306 307 308 309 310
/**
 * 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
 */
function relaxRightToLeft(nodesByBreadth, alpha) {
    zrUtil.each(nodesByBreadth.slice().reverse(), function (nodes) {
        zrUtil.each(nodes, function (node) {
            if (node.outEdges.length) {
                var y = sum(node.outEdges, weightedTarget) / sum(node.outEdges, getEdgeValue);
                var nodeY = node.getLayout().y + (y - center(node)) * alpha;
D
deqingli 已提交
311
                node.setLayout({y: nodeY}, true);
L
lang 已提交
312
            }
D
deqingli 已提交
313
        });
S
sushuang 已提交
314 315
    });
}
D
deqingli 已提交
316

S
sushuang 已提交
317 318 319
function weightedTarget(edge) {
    return center(edge.node2) * edge.getValue();
}
D
deqingli 已提交
320

S
sushuang 已提交
321 322 323 324 325 326 327 328 329 330 331 332 333 334 335
/**
 * 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
 */
function relaxLeftToRight(nodesByBreadth, alpha) {
    zrUtil.each(nodesByBreadth, function (nodes) {
        zrUtil.each(nodes, function (node) {
            if (node.inEdges.length) {
                var y = sum(node.inEdges, weightedSource) / sum(node.inEdges, getEdgeValue);
                var nodeY = node.getLayout().y + (y - center(node)) * alpha;
                node.setLayout({y: nodeY}, true);
            }
D
deqingli 已提交
336
        });
S
sushuang 已提交
337 338
    });
}
D
deqingli 已提交
339

S
sushuang 已提交
340 341 342
function weightedSource(edge) {
    return center(edge.node1) * edge.getValue();
}
D
deqingli 已提交
343

S
sushuang 已提交
344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359
/**
 * Compute the depth(y-position) of each edge
 *
 * @param {module:echarts/data/Graph~Node} nodes  node of sankey view
 */
function computeEdgeDepths(nodes) {
    zrUtil.each(nodes, function (node) {
        node.outEdges.sort(ascendingTargetDepth);
        node.inEdges.sort(ascendingSourceDepth);
    });
    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 已提交
360
        });
S
sushuang 已提交
361 362 363
        zrUtil.each(node.inEdges, function (edge) {
            edge.setLayout({ty: ty}, true);
            ty += edge.getLayout().dy;
D
deqingli 已提交
364
        });
S
sushuang 已提交
365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
    });
}

function ascendingTargetDepth(a, b) {
    return a.node2.getLayout().y - b.node2.getLayout().y;
}

function ascendingSourceDepth(a, b) {
    return a.node1.getLayout().y - b.node1.getLayout().y;
}

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

S
sushuang 已提交
389 390 391
function center(node) {
    return node.getLayout().y + node.getLayout().dy / 2;
}
D
deqingli 已提交
392

S
sushuang 已提交
393 394 395
function ascendingDepth(a, b) {
    return a.getLayout().y - b.getLayout().y;
}
D
deqingli 已提交
396

S
sushuang 已提交
397
function ascending(a, b) {
398
    return a - b;
S
sushuang 已提交
399
}
D
deqingli 已提交
400

S
sushuang 已提交
401 402 403
function getEdgeValue(edge) {
    return edge.getValue();
}