sankeyLayout.js 11.2 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 7 8
import layout from '../../util/layout';
import nest from '../../util/array/nest';
import {util as zrUtil} from 'zrender';
D
deqingli 已提交
9

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

S
sushuang 已提交
78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98
/**
 * Compute the x-position for each node
 *
 * @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
 */
function computeNodeBreadths(nodes, nodeWidth, width) {
    var remainNodes = nodes;
    var nextNode = null;
    var x = 0;
    var kx = 0;

    while (remainNodes.length) {
        nextNode = [];
        for (var i = 0, len = remainNodes.length; i < len; i++) {
            var node = remainNodes[i];
            node.setLayout({x: x}, true);
            node.setLayout({dx: nodeWidth}, true);
            for (var j = 0, lenj = node.outEdges.length; j < lenj; j++) {
                nextNode.push(node.outEdges[j].node2);
D
deqingli 已提交
99
            }
S
sushuang 已提交
100 101 102
        }
        remainNodes = nextNode;
        ++x;
D
deqingli 已提交
103 104
    }

S
sushuang 已提交
105 106
    moveSinksRight(nodes, x);
    kx = (width - nodeWidth) / (x - 1);
D
deqingli 已提交
107

S
sushuang 已提交
108 109
    scaleNodeBreadths(nodes, kx);
}
D
deqingli 已提交
110

S
sushuang 已提交
111 112 113 114 115 116 117 118 119 120 121 122
/**
 * 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 已提交
123
        }
S
sushuang 已提交
124 125
    });
}
D
deqingli 已提交
126

S
sushuang 已提交
127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
/**
 * 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 已提交
159
        });
160

S
sushuang 已提交
161 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
    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 已提交
192
        });
S
sushuang 已提交
193 194 195 196 197 198 199 200 201 202 203 204 205 206
        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 已提交
207
        });
S
sushuang 已提交
208
    });
D
deqingli 已提交
209

S
sushuang 已提交
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242
    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 已提交
243

S
sushuang 已提交
244 245 246 247 248 249 250
        // if the bottommost node goes outside the bounds, push it back up
        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 已提交
251
                node = nodes[i];
S
sushuang 已提交
252
                dy = node.getLayout().y + node.getLayout().dy + nodeGap - y0;
253
                if (dy > 0) {
S
sushuang 已提交
254
                    nodeY = node.getLayout().y - dy;
D
deqingli 已提交
255 256
                    node.setLayout({y: nodeY}, true);
                }
S
sushuang 已提交
257
                y0 = node.getLayout().y;
D
deqingli 已提交
258
            }
S
sushuang 已提交
259 260 261
        }
    });
}
D
deqingli 已提交
262

S
sushuang 已提交
263 264 265 266 267 268 269 270 271 272 273 274 275
/**
 * 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 已提交
276
                node.setLayout({y: nodeY}, true);
L
lang 已提交
277
            }
D
deqingli 已提交
278
        });
S
sushuang 已提交
279 280
    });
}
D
deqingli 已提交
281

S
sushuang 已提交
282 283 284
function weightedTarget(edge) {
    return center(edge.node2) * edge.getValue();
}
D
deqingli 已提交
285

S
sushuang 已提交
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
/**
 * 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 已提交
301
        });
S
sushuang 已提交
302 303
    });
}
D
deqingli 已提交
304

S
sushuang 已提交
305 306 307
function weightedSource(edge) {
    return center(edge.node1) * edge.getValue();
}
D
deqingli 已提交
308

S
sushuang 已提交
309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
/**
 * 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 已提交
325
        });
S
sushuang 已提交
326 327 328
        zrUtil.each(node.inEdges, function (edge) {
            edge.setLayout({ty: ty}, true);
            ty += edge.getLayout().dy;
D
deqingli 已提交
329
        });
S
sushuang 已提交
330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348
    });
}

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 已提交
349 350
        }
    }
S
sushuang 已提交
351 352
    return sum;
}
D
deqingli 已提交
353

S
sushuang 已提交
354 355 356
function center(node) {
    return node.getLayout().y + node.getLayout().dy / 2;
}
D
deqingli 已提交
357

S
sushuang 已提交
358 359 360
function ascendingDepth(a, b) {
    return a.getLayout().y - b.getLayout().y;
}
D
deqingli 已提交
361

S
sushuang 已提交
362 363 364
function ascending(a, b) {
    return a < b ? -1 : a > b ? 1 : a === b ? 0 : NaN;
}
D
deqingli 已提交
365

S
sushuang 已提交
366 367 368
function getEdgeValue(edge) {
    return edge.getValue();
}