Minimizing edge crossing is a key problem in drawing layered digraphs, and it's directly involved with the readability of the graph.

最小化边交叉数是层次图绘制过程中的一个关键步骤，直接影响着层次图的可读性。

youdao

Minimizing edge crossing is a key problem in drawing layered digraphs, and it's directly involved with the readability of the graph.

最小化边交叉数是层次图绘制过程中的一个关键步骤，直接影响着层次图的可读性。

youdao