更改

本词条由Ryan初步翻译

本词条由Ryan初步翻译

{{for|the family of graphs known as paths|Path graph}}

{{for|the family of graphs known as paths|Path graph}}

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.

在'''<font color="#ff8000">图论 Graph Theory</font>'''中，图中的'''<font color="#ff8000">路径 Path</font>'''是一个有限或无限的边序列，这些边连接着一系列顶点，这些顶点在大多数定义中都是不同的(因为顶点是不同的，所以边也是不同的)。'''<font color="#ff8000">有向图 Directed Graph</font>'''中的有向路径(有时称为dipath)是一个有限或无限的边序列，它连接一系列不同的顶点，但附加的限制是所有的边都朝向同一个方向。

在'''<font color="#ff8000">图论 Graph Theory</font>'''中，图中的'''<font color="#ff8000">路径 Path</font>'''是一个有限或无限的边序列，这些边连接着一系列顶点，这些顶点在大多数定义中都是不同的(因为顶点是不同的，所以边也是不同的)。'''<font color="#ff8000">有向图 Directed Graph</font>'''中的有向路径(有时称为dipath)是一个有限或无限的边序列，它连接一系列不同的顶点，但附加的条件是所有的边都方向相同。