579
个编辑
更改
无编辑摘要
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）在篇首写下 本词条由[[用户名]]初步翻译
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。
[[File:Directed.svg|160px|thumb|A [[directed graph]] with three [[Vertex (graph theory)|vertices]] (blue circles) and three [[Edge (graph theory)|edges]] (black arrows).]]
[[File:Directed.svg|160px|thumb|A [[directed graph]] with three [[Vertex (graph theory)|vertices]] (blue circles) and three [[Edge (graph theory)|edges]] (black arrows).]]
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）注意图的格式 转行写[图1： 英文加翻译内容]
A [[directed graph with three vertices (blue circles) and three edges (black arrows).]]
一个[有三个顶点(蓝色圆圈)和三条边(黑色箭头)的有向图]
一个[有三个顶点(蓝色圆圈)和三条边(黑色箭头)的有向图]
==Operations==
==Operations==
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）章节名记得翻译
The basic operations provided by a graph data structure ''G'' usually include:<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>
The basic operations provided by a graph data structure ''G'' usually include:<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>
The basic operations provided by a graph data structure G usually include:
The basic operations provided by a graph data structure G usually include:
图形数据结构 g 提供的基本操作通常包括:
图形数据结构 G 提供的基本操作通常包括:
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）变量斜体
* <code>adjacent</code>(''G'', ''x'', ''y''): tests whether there is an edge from the vertex ''x'' to the vertex ''y'';
* <code>adjacent</code>(''G'', ''x'', ''y''): tests whether there is an edge from the vertex ''x'' to the vertex ''y'';
在共享内存模型的情况下，用于并行处理的图表示与顺序处理相同，因为对图表示的并行只读访问(例如:。邻接表)是共享内存的有效方法。
在共享内存模型的情况下，用于并行处理的图表示与顺序处理相同，因为对图表示的并行只读访问(例如:。邻接表)是共享内存的有效方法。
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）通读一遍 注意多余符号的问题(例如:。邻接表)
=== Distributed Memory ===
=== Distributed Memory ===
* [[Graph drawing software]] for software, systems, and providers of systems for drawing graphs
* [[Graph drawing software]] for software, systems, and providers of systems for drawing graphs
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）see also记得翻译完全
--[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）可以看看之前发的链接“集智百科翻译团队新手指南”按着上面的要求再核对一下 比如专业名词标橙 疑难句标绿
==References==
==References==