一个多段图的画图算法

Algorithm for Drawing Multistage Graph

给出了一个时间复杂度为Ｏ（ｎ＋ｅ）的多段图的画图算法．该算法除了可以用来画多段图外，也可以用来画树、二分图等其它特殊类型的图．

A algorithm for drawing multistage graph with time complexity O(n+e) is presented.In addition to drawing multistage graph,this algorithm can be used to draw trees,bipartite graphs and the graphs of other special types.