526
个编辑
更改
→Directed walk, trail, path 有向的步道，轨迹，路径
* A '''directed trail''' is a directed walk in which all edges are distinct.{{sfn|Bender|Williamson|2010|p=162}}
* A '''directed trail''' is a directed walk in which all edges are distinct.{{sfn|Bender|Williamson|2010|p=162}}
'''<font color="#ff8000">有向轨迹 Directed Trail</font>'''是指所有边缘都清晰可见的轨迹。
'''<font color="#ff8000">有向轨迹 Directed Trail</font>'''是指所有边都可见的轨迹。
* A '''directed path''' is a directed trail in which all vertices are distinct.{{sfn|Bender|Williamson|2010|p=162}}
* A '''directed path''' is a directed trail in which all vertices are distinct.{{sfn|Bender|Williamson|2010|p=162}}
'''<font color="#ff8000">有向路径 Directed Path</font>'''是指所有顶点都是不同的有向路径。
'''<font color="#ff8000">有向路径 Directed Path</font>'''是指所有顶点都不同的有向路径。
If is a finite directed walk with vertex sequence then w is said to be a walk from v<sub>1</sub> to v<sub>n</sub>. Similarly for a directed trail or a path. If there is a finite directed walk between two distinct vertices then there is also a finite directed trail and a finite directed path between them.
If is a finite directed walk with vertex sequence then w is said to be a walk from v<sub>1</sub> to v<sub>n</sub>. Similarly for a directed trail or a path. If there is a finite directed walk between two distinct vertices then there is also a finite directed trail and a finite directed path between them.
假设一个步道{{nowrap|1=''w'' = (''e''<sub>1</sub>, ''e''<sub>2</sub>, …, ''e''<sub>''n'' − 1</sub>)}}是顶点序列有限的{{nowrap|(''v''<sub>1</sub>, ''v''<sub>2</sub>, …, ''v''<sub>''n''</sub>)}}有向步道，那么 w 就是从 ''v''<sub>1</sub> ''到'' ''v''<sub>''n''</sub>的步行。同样，对于有向轨迹或路径也是如此。如果在两个不同的顶点之间存在有限有向步道，那么在它们之间也存在有限有向轨迹和有限有向路径。
假设一个步道{{nowrap|1=''w'' = (''e''<sub>1</sub>, ''e''<sub>2</sub>, …, ''e''<sub>''n'' − 1</sub>)}}是顶点序列有限的{{nowrap|(''v''<sub>1</sub>, ''v''<sub>2</sub>, …, ''v''<sub>''n''</sub>)}}有向步道，那么 w 就是从 ''v''<sub>1</sub> ''到'' ''v''<sub>''n''</sub>的步道。同样，对于有向轨迹或路径也是如此。如果在两个不同的顶点之间存在有限有向步道，那么在它们之间也存在有限有向轨迹和有限有向路径。