Heuristics for edge drawing in a graph-based visual language

摘要

Control-flow diagrams are often criticized as difficult to read because of numerous edge intersections. To improve the readability we propose a solution that manages the visual complexity of graphs with hundreds, or even thousands of nodes. It consists in applying heuristics to choose the best path for an edge and an appropriate color that will help distinguish an edge from its neighbors.