更改

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.

在计算机科学中，图是一种抽象的数据类型，用来实现数学中图论领域中的'''<font color="#ff8000">无向图 Undirected Graph</font>'''和'''<font color="#ff8000">有向图 Directed Graph</font>'''的概念。

在计算机科学中，图是一种抽象的数据类型，用来展现数学中图论领域中的'''<font color="#ff8000">无向图 Undirected Graph</font>'''和'''<font color="#ff8000">有向图 Directed Graph</font>'''的概念。

A graph data structure consists of a finite (and possibly mutable) set of vertices (also called nodes or points), together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges (also called links or lines), and for a directed graph are also known as arrows. The vertices may be part of the graph structure, or may be external entities represented by integer indices or references.

A graph data structure consists of a finite (and possibly mutable) set of vertices (also called nodes or points), together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges (also called links or lines), and for a directed graph are also known as arrows. The vertices may be part of the graph structure, or may be external entities represented by integer indices or references.

一个图的数据结构由一个有限的(也可能是可变的)'''<font color="#ff8000">顶点集 Set Of Vertices</font>'''(也称为节点或点) ，以及一组无向图的无序顶点对或有向图的有序对组成。这些连线称为边(也称为链接或直线) ，对于有向图，也称为箭头。顶点可以是图结构的一部分，也可以是由整数索引或引用表示的外部实体。

一个图的数据结构由一个有限的(也可能是可变的)'''<font color="#ff8000">顶点集 Set Of Vertices</font>'''(也称为节点或点) ，以及一组无向图的无序顶点对或有向图的有序顶点对组成。这些连线被称为边(也称为链接或直线) ，对于有向图，也称为箭头。顶点可以是图结构的一部分，也可以是由整数索引或引用表示的外部实体。