图的绘制 Graph drawing - 版本历史

薄荷：/* 其他链接 */

2020-12-27T16:01:48Z

其他链接

薄荷：/* 布局方法 Layout methods */

2020-11-21T17:30:44Z

布局方法 Layout methods

薄荷：薄荷移动页面图的绘制至图的绘制 Graph drawing

2020-11-21T17:30:05Z

薄荷移动页面图的绘制至图的绘制 Graph drawing

薄荷：/* 布局方法 Layout methods */

2020-11-21T17:29:29Z

布局方法 Layout methods

薄荷：/* 布局方法 Layout methods */

2020-11-21T17:29:09Z

布局方法 Layout methods

2020年11月21日 (六) 17:28 薄荷

2020-11-21T17:28:44Z

薄荷：/* 专门的子主题 */

2020-11-21T17:27:15Z

专门的子主题

2020年11月21日 (六) 17:25 薄荷

2020-11-21T17:25:01Z

2020年11月21日 (六) 17:24 薄荷

2020-11-21T17:24:22Z

薄荷：/* 参考文献 */

2020-11-21T17:23:36Z

参考文献

@@ 第194行： / 第194行： @@
 * [http://gdea.informatik.uni-koeln.de/ Graph drawing e-print archive]: including information on papers from all [[International Symposium on Graph Drawing|Graph Drawing symposia]].
-* {{dmoz|Science/Math/Combinatorics/Software/Graph_Drawing}} for many additional links related to graph drawing.
 ----

@@ 第58行： / 第58行： @@
 [[File:Social Network Analysis Visualization.png|thumb|right|图4：基于力的网络可视化 <ref>{{Cite journal | volume = 10| issue = 3| last = Grandjean| first = Martin| title = La connaissance est un réseau| journal =Les Cahiers du Numérique| accessdate = 2014-10-15| date = 2014| pages = 37–54| url = http://www.cairn.info/resume.php?ID_ARTICLE=LCN_103_0037| doi=10.3166/lcn.10.3.37-54}}</ref>]]
 有许多不同的图形布局方法，如下：
@@ 第71行： / 第72行： @@
 *'''<font color="#ff8000">分层图绘制方法 Layered graph drawing</font>'''（通常称为'''杉山式图 Sugiyama-style drawing'''）最适合于'''<font color="#ff8000">有向无环图 directed acyclic graphs</font>'''或接近无环的图，例如软件系统中模块或函数之间的依赖关系图。在这些方法中，图的节点使用Coffman Graham算法等方法被安排到水平层中，以这样的方式，大多数边从一层向下到下一层;在这一步之后，将每一层内的节点进行排列，使交叉最少。<ref>Sugiyama, Tagawa & Toda (1981); Bastert & Matuszewski (2001); Di Battista et al. (1994), Chapter 9, "Layered Drawings of Digraphs", pp. 265–302.</ref>
 *'''<font color="#ff8000">弧线图 Arc Diagram</font>'''，这种布局风格可以追溯到20世纪60年代，<ref>Saaty (1964).</ref>{将顶点放在一条直线上;边缘可以画成在直线上方或下方的半圆，也可以画成由多个半圆连接在一起的光滑曲线。

@@ 第69行： / 第69行： @@
 *'''树形布局'''算法显示了一种类似树的根状结构，适合树。通常，在一种称为'''气球布局'''的技术中，树形图每个节点的子节点被画在围绕该节点的圆上，这些圆的半径在树的较低层次上递减，因此这些圆不会重叠。<ref> Herman, Melançon & Marshall (2000), Section 2.2, "Traditional Layout – An Overview".</ref>
-*'''<font color="#ff8000">分层图绘制方法 Layered graph drawing</font>'''(通常称为'''杉山式图 Sugiyama-style drawing''')最适合于'''<font color="#ff8000">有向无环图 directed acyclic graphs</font>'''或接近无环的图，例如软件系统中模块或函数之间的依赖关系图。在这些方法中，图的节点使用Coffman Graham算法等方法被安排到水平层中，以这样的方式，大多数边从一层向下到下一层;在这一步之后，将每一层内的节点进行排列，使交叉最少。<ref>Sugiyama, Tagawa & Toda (1981); Bastert & Matuszewski (2001); Di Battista et al. (1994), Chapter 9, "Layered Drawings of Digraphs", pp. 265–302.</ref>
+*'''<font color="#ff8000">分层图绘制方法 Layered graph drawing</font>'''（通常称为'''杉山式图 Sugiyama-style drawing'''）最适合于'''<font color="#ff8000">有向无环图 directed acyclic graphs</font>'''或接近无环的图，例如软件系统中模块或函数之间的依赖关系图。在这些方法中，图的节点使用Coffman Graham算法等方法被安排到水平层中，以这样的方式，大多数边从一层向下到下一层;在这一步之后，将每一层内的节点进行排列，使交叉最少。<ref>Sugiyama, Tagawa & Toda (1981); Bastert & Matuszewski (2001); Di Battista et al. (1994), Chapter 9, "Layered Drawings of Digraphs", pp. 265–302.</ref>
 [[File:Goldner-Harary-linear.svg|thumb|图5：弧线图]]

@@ 第59行： / 第59行： @@
 [[File:Social Network Analysis Visualization.png|thumb|right|图4：基于力的网络可视化 <ref>{{Cite journal | volume = 10| issue = 3| last = Grandjean| first = Martin| title = La connaissance est un réseau| journal =Les Cahiers du Numérique| accessdate = 2014-10-15| date = 2014| pages = 37–54| url = http://www.cairn.info/resume.php?ID_ARTICLE=LCN_103_0037| doi=10.3166/lcn.10.3.37-54}}</ref>]]
-有许多不同的图形布局方法，如下
+有许多不同的图形布局方法，如下：
 *在'''<font color="#ff8000">基于力的布局系统 Force-Based Layout</font>'''中，图形绘制软件根据基于弹簧系统或分子力学的物理隐含的力系统，不断移动顶点来修改初始顶点的位置。通常，这些系统将相邻顶点之间的吸引力与所有对顶点之间的排斥力结合起来，以寻求一种边长较小而顶点分离良好的布局。这些系统可以执行'''<font color="#ff8000">梯度下降 gradient descent</font>'''最小化的能量函数，或可以把力直接转化为节点的速度或加速度。<ref>Di Battista et al. (1994), Section 2.7, "The Force-Directed Approach", pp. 29–30, and Chapter 10, "Force-Directed Methods", pp. 303–326.</ref>

@@ 第16行： / 第16行： @@
 [[File:4node-digraph-natural.svg|thumb|upright=0.5|图2：带箭头显示边方向的[[有向图]]]]
-图经常绘制成节点链接图，其中顶点可以是为圆框、方框或文本标签，边表示为'''<font color="#ff8000">欧式平面 Euclidean Plane</font>'''上的线段、折线或曲线。<ref name="dett-viii">Di Battista et al. (1994), p. viii.</ref>节点链接图可以追溯到13世纪雷蒙·卢尔 Ramon Llull的作品，他为得到'''完全图'''，绘制了这种类型的图，以便分析形而上学概念集合之间的所有成对组合。<ref>{{citation|contribution=Two thousand years of combinatorics|first=Donald E.|last=Knuth|authorlink=Donald Knuth|pages=7–37|title=Combinatorics: Ancient and Modern|publisher=Oxford University Press|year=2013|editor1-first=Robin|editor1-last=Wilson|editor2-first=John J.|editor2-last=Watkins}}.</ref>
+图经常绘制成节点链接图，其中顶点可以是为圆框、方框或文本标签，边表示为'''<font color="#ff8000">欧式平面 Euclidean Plane</font>'''上的线段、折线或曲线。<ref name="dett-viii">Di Battista et al. (1994), p. viii.</ref>节点链接图可以追溯到13世纪雷蒙·卢尔 Ramon Llull的作品，他为得到'''完全图'''，绘制了这种类型的图，以便分析形而上学概念集合之间的所有成对组合。<ref>{{citation|contribution=Two thousand years of combinatorics|first=Donald E.|last=Knuth|pages=7–37|title=Combinatorics: Ancient and Modern|publisher=Oxford University Press|year=2013|editor1-first=Robin|editor1-last=Wilson|editor2-first=John J.|editor2-last=Watkins}}.</ref>
@@ 第149行： / 第149行： @@
 *{{citation | last1 = Di Battista | first1 = Giuseppe | last2 = Eades | first2 = Peter | last3 = Tamassia | first3 = Roberto  | last4 = Tollis | first4 = Ioannis G. | journal =Computational Geometry: Theory and Applications | pages = 235–282 | title = Algorithms for Drawing Graphs: an Annotated Bibliography| url = http://www.cs.brown.edu/people/rt/gd.html| volume = 4 | issue = 5
   | year = 1994 | doi=10.1016/0925-7721(94)00014-x}}.
-*{{citation | last1 = Di Battista | first1 = Giuseppe | last2 = Eades | first2 = Peter | | last3 = Tamassia | first3 = Roberto |  | last3 = Tamassia | first3 = Roberto | author3-link = Roberto Tamassia | last4 = Tollis | first4 = Ioannis G. | isbn = 978-0-13-301615-4 | publisher = Prentice Hall | title = Graph Drawing: Algorithms for the Visualization of Graphs | year = 1998}}.
+*{{citation | last1 = Di Battista | first1 = Giuseppe | last2 = Eades | first2 = Peter | | last3 = Tamassia | first3 = Roberto |  | last3 = Tamassia | first3 = Roberto | last4 = Tollis | first4 = Ioannis G. | isbn = 978-0-13-301615-4 | publisher = Prentice Hall | title = Graph Drawing: Algorithms for the Visualization of Graphs | year = 1998}}.
 *{{citation | doi = 10.1109/2945.841119| last1 = Herman | first1 = Ivan | last2 = Melançon | first2 = Guy | last3 = Marshall | first3 = M. Scott | journal = IEEE Transactions on Visualization and Computer Graphics | pages = 24–43| title = Graph Visualization and Navigation in Information Visualization: A Survey | issue = 1 | volume = 6 | year = 2000 }}.
 *{{citation | last1 = Jünger | first1 = Michael | last2 = Mutzel | first2 = Petra  | isbn = 978-3-540-00881-1 | publisher = Springer-Verlag| title = Graph Drawing Software | year = 2004}}.
 *{{citation|title=Drawing Graphs: Methods and Models|editor1-first=Michael|editor1-last=Kaufmann|editor2-first=Dorothea|editor2-last=Wagner|publisher=Springer-Verlag|series=Lecture Notes in Computer Science|volume=2025|year=2001|doi=10.1007/3-540-44969-8|isbn=978-3-540-42062-0}}.
-*{{citation|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|url=http://cs.brown.edu/~rt/gdhandbook/|year=2014|access-date=2013-08-28|archive-url=https://web.archive.org/web/20130815181243/http://cs.brown.edu/~rt/gdhandbook/|archive-date=2013-08-15|url-status=dead}}.
+*{{citation|editor-first=Roberto|editor-last=Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|url=http://cs.brown.edu/~rt/gdhandbook/|year=2014|access-date=2013-08-28|archive-url=https://web.archive.org/web/20130815181243/http://cs.brown.edu/~rt/gdhandbook/|archive-date=2013-08-15|url-status=dead}}.
 {{refend}}
@@ 第162行： / 第162行： @@
 *{{citation|title=Automata Theory with Modern Applications|first1=James Andrew|last1=Anderson|first2=Thomas J.|last2=Head|publisher=Cambridge University Press|year=2006|isbn=978-0-521-84887-9|pages=38–41|url=https://books.google.com/books?id=ikS8BLdLDxIC&pg=PA38}}.
-*{{citation|first1=Christian|last1=Bachmaier|first2=Ulrik|last2=Brandes|first3=Falk|last3=Schreiber|contribution=Biological Networks|pages=621–651|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
+*{{citation|first1=Christian|last1=Bachmaier|first2=Ulrik|last2=Brandes|first3=Falk|last3=Schreiber|contribution=Biological Networks|pages=621–651|editor-first=Roberto|editor-last=Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
-*{{citation|contribution=Layered drawings of digraphs|first1=Oliver|last1=Bastert|first2=Christian|last2=Matuszewski|title=Drawing Graphs: Methods and Models|editor1-first=Michael|editor1-last=Kaufmann|editor2-first=Dorothea|editor2-last=Wagner|editor2-link=Dorothea Wagner|publisher=Springer-Verlag|series=Lecture Notes in Computer Science|volume=2025|year=2001|pages=87–120|doi=10.1007/3-540-44969-8_5|isbn=978-3-540-42062-0}}.
+*{{citation|contribution=Layered drawings of digraphs|first1=Oliver|last1=Bastert|first2=Christian|last2=Matuszewski|title=Drawing Graphs: Methods and Models|editor1-first=Michael|editor1-last=Kaufmann|editor2-first=Dorothea|editor2-last=Wagner|publisher=Springer-Verlag|series=Lecture Notes in Computer Science|volume=2025|year=2001|pages=87–120|doi=10.1007/3-540-44969-8_5|isbn=978-3-540-42062-0}}.
 *{{citation | last = Beckman | first = Brian | publisher = Microsoft Research | series = Tech. Report MSR-TR-94-04 | title = Theory of Spectral Graph Layout | url = http://research.microsoft.com/apps/pubs/default.aspx?id=69611 | year = 1994}}.
-*{{citation|first1=Ulrik|last1=Brandes|first2=Linton C.|last2=Freeman|first3=Dorothea|last3=Wagner|author3-link=Dorothea Wagner|contribution=Social Networks|pages=805–839|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
+*{{citation|first1=Ulrik|last1=Brandes|first2=Linton C.|last2=Freeman|first3=Dorothea|last3=Wagner|contribution=Social Networks|pages=805–839|editor-first=Roberto|editor-last=Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
-*{{citation|first1=Giuseppe|last1=Di Battista|first2=Massimo|last2=Rimondini|contribution=Computer Networks|pages=763–803|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
+*{{citation|first1=Giuseppe|last1=Di Battista|first2=Massimo|last2=Rimondini|contribution=Computer Networks|pages=763–803|editor-first=Roberto|editor-last=Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}.
 *{{citation | last1 = Doğrusöz | first1 = Uğur | last2 = Madden | first2 = Brendan| last3 = Madden | first3 = Patrick | editor-last = North | editor-first = Stephen| contribution = Circular layout in the Graph Layout toolkit | doi = 10.1007/3-540-62495-3_40 | pages = 92–100| publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings | volume = 1190 | year = 1997| isbn = 978-3-540-62495-0 | doi-access = free }}.
 *{{citation| last1 = Eiglsperger | first1 = Markus | last2 = Fekete | first2 = Sándor | last3 = Klau | first3 = Gunnar | contribution = Orthogonal graph drawing | doi = 10.1007/3-540-44969-8_6 | editor1-last = Kaufmann | editor1-first = Michael | editor2-last = Wagner | editor2-first = Dorothea |pages = 121–171 | publisher = Springer Berlin / Heidelberg | series = Lecture Notes in Computer Science | title = Drawing Graphs | volume = 2025 | year = 2001| isbn = 978-3-540-42062-0 }}.
 *{{citation | last = Freese | first = Ralph | editor-last = Eklund | editor-first = Peter | contribution = Automated lattice drawing | doi = 10.1007/978-3-540-24651-0_12 | pages = 589–590 | publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings | url = http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf | volume = 2961 | year = 2004| isbn = 978-3-540-21043-6 | citeseerx = 10.1.1.69.6245 }}.
 *{{citation | last1 = Garg | first1 = Ashim | last2 = Tamassia | first2 = Roberto | doi = 10.1007/BF01108622| issue = 2 | journal = Order | mr = 1354797 | pages = 109–133 | title = Upward planarity testing | volume = 12 | year = 1995| citeseerx = 10.1.1.10.2237 }}.
-*{{citation | last1 = Holten | first1 = Danny | last2 = Isenberg | first2 = Petra | last3 = van Wijk | first3 = Jarke J. | author3-link = Jack van Wijk | last4 = Fekete | first4 = Jean-Daniel | last4 = Fekete | first4 = Jean-Daniel | contribution = An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs | doi = 10.1109/PACIFICVIS.2011.5742390 | pages = 195–202 | title = IEEE Pacific Visualization Symposium (PacificVis 2011) | url = http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf | year = 2011| isbn = 978-1-61284-935-5 }}.
+*{{citation | last1 = Holten | first1 = Danny | last2 = Isenberg | first2 = Petra | last3 = van Wijk | first3 = Jarke J. |last4 = Fekete | first4 = Jean-Daniel | last4 = Fekete | first4 = Jean-Daniel | contribution = An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs | doi = 10.1109/PACIFICVIS.2011.5742390 | pages = 195–202 | title = IEEE Pacific Visualization Symposium (PacificVis 2011) | url = http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf | year = 2011| isbn = 978-1-61284-935-5 }}.
 *{{citation |last1= Holten |first1 = Danny |last2 = van Wijk |first2= Jarke J. |contribution = A user study on visualizing directed edges in graphs |doi= 10.1145/1518701.1519054 |pages= 2299–2308 |title= Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09) |url= http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf |year = 2009 |url-status= dead |archiveurl   = https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf|archivedate  = 2011-11-06|isbn= 9781605582467 |citeseerx= 10.1.1.212.5461}}.
 *{{citation | last = Koren | first = Yehuda | doi = 10.1016/j.camwa.2004.08.015 | issue = 11–12 | journal = Computers & Mathematics with Applications | mr = 2154691 | pages = 1867–1888 | title = Drawing graphs by eigenvectors: theory and practice | url = https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| volume = 49| year = 2005| access-date = 2011-09-17 | archive-url = https://web.archive.org/web/20120402131402/https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| archive-date = 2012-04-02 | url-status = dead }}.
 *{{citation | last = Longabaugh | first = William | doi = 10.1186/1471-2105-13-275 | journal = BMC Bioinformatics | pages = 275 | title = Combing the hairball with BioFabric: a new approach for visualization of large networks | url = http://www.biomedcentral.com/content/pdf/1471-2105-13-275.pdf| pmid = 23102059| volume = 13| year = 2012| pmc=3574047}}.
-*{{citation| last1 = Madden | first1 = Brendan| last2 = Madden | first2 = Patrick| last3 = Powers | first3 = Steve| last4 = Himsolt | first4 = Michael| editor-last = Brandenburg | editor-first = Franz J.| contribution = Portable graph layout and editing| doi = 10.1007/BFb0021822| pages = 385–395 | publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings | volume = 1027| year = 1996| title-link = International Symposium on Graph Drawing| isbn = 978-3-540-60723-6| doi-access = free }}.
+*{{citation| last1 = Madden | first1 = Brendan| last2 = Madden | first2 = Patrick| last3 = Powers | first3 = Steve| last4 = Himsolt | first4 = Michael| editor-last = Brandenburg | editor-first = Franz J.| contribution = Portable graph layout and editing| doi = 10.1007/BFb0021822| pages = 385–395 | publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings | volume = 1027| year = 1996| isbn = 978-3-540-60723-6| doi-access = free }}.
 *{{citation | last1 = Misue | first1= K. | last2 = Eades  | first2= P.| last3 = Lai  | first3 = W.| last4 = Sugiyama | first4 = K. | title = Layout Adjustment and the Mental Map | journal = Journal of Visual Languages and Computing | volume = 6 | number = 2 | pages = 183–210 | year = 1995 | doi=10.1006/jvlc.1995.1010}}.
 *{{citation| last1 = Nachmanson | first1 = Lev | last2 = Robertson | first2 = George| last3 = Lee | first3 = Bongshin| editor1-last = Hong | editor1-first = Seok-Hee | editor2-last = Nishizeki | editor2-first = Takao| editor3-last = Quan | editor3-first = Wu| contribution = Drawing Graphs with GLEE| doi = 10.1007/978-3-540-77537-9_38| pages = 389–394| publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers| contribution-url = ftp://ftp.research.microsoft.com/pub/TR/TR-2007-72.pdf| volume = 4875| year = 2008|| isbn = 978-3-540-77536-2| doi-access = free }}.
@@ 第182行： / 第182行： @@
 *{{citation | last = Saaty | first = Thomas L. | journal = Proc. Natl. Acad. Sci. U.S.A. | pages = 688–690 | title = The minimum number of intersections in complete graphs | volume = 52 | volume = 52| issue = 3 | year = 1964 | doi=10.1073/pnas.52.3.688| pmid = 16591215 | pmc = 300329}}.
 *{{citation|title=Social network analysis: a handbook|first=John|last=Scott|edition=2nd|publisher=Sage|year=2000|isbn=978-0-7619-6339-4|contribution=Sociograms and Graph Theory|url=https://books.google.com/books?id=Ww3_bKcz6kgC&pg=PA|pages=64–69}}.
-*{{citation|first1=Kozo|last1=Sugiyama|author1-link=Kozo Sugiyama|first2=Shôjirô|last2=Tagawa|first3=Mitsuhiko|last3=Toda|title=Methods for visual understanding of hierarchical system structures|journal=IEEE Systems, Man & Cybernetics Society|volume=SMC-11|issue=2|pages=109–125|year=1981|mr=0611436|doi=10.1109/TSMC.1981.4308636}}.
+*{{citation|first1=Kozo|last1=Sugiyama|first2=Shôjirô|last2=Tagawa|first3=Mitsuhiko|last3=Toda|title=Methods for visual understanding of hierarchical system structures|journal=IEEE Systems, Man & Cybernetics Society|volume=SMC-11|issue=2|pages=109–125|year=1981|mr=0611436|doi=10.1109/TSMC.1981.4308636}}.
 *{{citation | last = Tantau | first = Till | doi = 10.7155/jgaa.00301 | issue = 4 | journal = Journal of Graph Algorithms and Applications | pages = 495–513 | title = Graph Drawing in TikZ | volume = 17 | year = 2013}}.
 * {{Citation | last1=Zapponi | first1=Leonardo | title=What is a Dessin d'Enfant | url=http://www.ams.org/notices/200307/what-is.pdf | date=August 2003 | journal=Notices of the American Mathematical Society | volume=50 | pages=788–789}}.

@@ 第140行： / 第140行： @@
 ==参考文献==
-{{refbegin|colwidth=30em}}
+{{reflist|colwidth=30em}}
 ===一般参考资料===
-{{reflist|colwidth=30em}}
+{{refbegin|colwidth=30em}}
 *{{citation | last1 = Di Battista | first1 = Giuseppe | last2 = Eades | first2 = Peter | last3 = Tamassia | first3 = Roberto  | last4 = Tollis | first4 = Ioannis G. | journal =Computational Geometry: Theory and Applications | pages = 235–282 | title = Algorithms for Drawing Graphs: an Annotated Bibliography| url = http://www.cs.brown.edu/people/rt/gd.html| volume = 4 | issue = 5