src/utilities/layout-engine/vertical-tree.js (54 lines of code) (raw):

// @flow /* Copyright(c) 2018 Uber Technologies, Inc. Licensed 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. */ import * as dagre from 'dagre'; import { type INode } from '../../components/node'; import SnapToGrid from './snap-to-grid'; class VerticalTree extends SnapToGrid { adjustNodes(nodes: INode[], nodesMap?: any): INode[] { const { nodeKey, nodeSize, nodeHeight, nodeWidth, nodeSpacingMultiplier, } = this.graphViewProps; const g = new dagre.graphlib.Graph(); g.setGraph({}); g.setDefaultEdgeLabel(() => ({})); const spacing = nodeSpacingMultiplier || 1.5; const size = (nodeSize || 1) * spacing; let height; let width; if (nodeHeight) { height = nodeHeight * spacing; } if (nodeWidth) { width = nodeWidth * spacing; } nodes.forEach(node => { if (!nodesMap) { return; } const nodeId = node[nodeKey]; const nodeKeyId = `key-${nodeId}`; const nodesMapNode = nodesMap[nodeKeyId]; // prevent disconnected nodes from being part of the graph if ( nodesMapNode.incomingEdges.length === 0 && nodesMapNode.outgoingEdges.length === 0 ) { return; } g.setNode(nodeKeyId, { width: width || size, height: height || size }); nodesMapNode.outgoingEdges.forEach(edge => { g.setEdge(nodeKeyId, `key-${edge.target}`); }); }); dagre.layout(g); g.nodes().forEach(gNodeId => { const nodesMapNode = nodesMap[gNodeId]; // gNode is the dagre representation const gNode = g.node(gNodeId); nodesMapNode.node.x = gNode.x; nodesMapNode.node.y = gNode.y; }); return nodes; } } export default VerticalTree;