hi??
At present, an initial version of DAG automatic layout has been implemented. There are still some problems with multi-node pointing. The specific implementation method: 1. Turn node data into tree-structured data and implement it recursively 2. Calculate the hierarchical tree of the tree and calculate the width between each node 3. Calculate the number of all leaf nodes, calculate the height of each leaf node, and then arrange the leaves in ascending order by width 4.Assign the height of each leaf to the upper parent node once 5. Calculate the height of the root node, (countree / 2) * 120 + 50 6, restore the tree data to the original format data, and then assign the value Specific code, please see pr on the dev branch (# 1497) Welcome friends who are interested in DAG automatic layout, and can put forward your ideas and suggestions! -------------- DolphinScheduler(Incubator) Caibiao Xiang --------------
