更改

跳到导航 跳到搜索
第17行: 第17行:  
==操作方式 Operations==
 
==操作方式 Operations==
   −
图形'' G ''的数据结构提供的基本操作通常包括:<ref name="gt-ops">See, e.g. {{harvtxt|Goodrich|Tamassia|2015}}, Section 13.1.2: Operations on graphs, p. 360. For a more detailed set of operations, see {{citation|contribution=Chapter 6: Graphs and their data structures|pages=240–282|title=LEDA: A platform for combinatorial and geometric computing|first1=K.|last1=Mehlhorn|author1-link=Kurt Mehlhorn|first2=S.|last2=Näher|publisher=Cambridge University Press|year=1999}}.</ref>
+
图形'' G ''的数据结构提供的基本操作通常包括:<ref name="gt-ops">See, e.g. Section 13.1.2: Operations on graphs, p. 360. For a more detailed set of operations, see {{citation|contribution=Chapter 6: Graphs and their data structures|pages=240–282|title=LEDA: A platform for combinatorial and geometric computing|first1=K.|last1=Mehlhorn|author1-link=Kurt Mehlhorn|first2=S.|last2=Näher|publisher=Cambridge University Press|year=1999}}.</ref>
    
* <code>adjacent</code>(''G'', ''x'', ''y''):检验顶点'' x ''到顶点'' y ''是否存在边;
 
* <code>adjacent</code>(''G'', ''x'', ''y''):检验顶点'' x ''到顶点'' y ''是否存在边;
7,129

个编辑

导航菜单