526
个编辑
更改
跳到导航
跳到搜索
第83行：
第83行： − 一个有向图{{nowrap|1=''G'' = (''V'', ''E'', ''ϕ'')}}。有限有向步道是一系列的边 {{nowrap|(''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>)}}。{{nowrap|1=''ϕ''(''e''<sub>''i''</sub>) = (''v''<sub>''i''</sub>, ''v''<sub>''i'' + 1</sub>)}}对于{{nowrap|1=''i'' = 1, 2, …, ''n'' − 1}}. {{nowrap|(''v''<sub>1</sub>, ''v''<sub>2</sub>, …, ''v''<sub>''n''</sub>)}}是有向步道的顶点序列。无限有向步道是一个边序列，其类型与本文描述的相同，但没有第一个顶点或最后一个顶点，而半无限有向步道(或射线)有第一个顶点，但没有最后一个顶点。+ 第113行：
第113行： − −
→Directed walk, trail, path 有向的步道，轨迹，路径
Let {{nowrap|1=''G'' = (''V'', ''E'', ''ϕ'')}} be a directed graph. A finite directed walk is a sequence of edges for which there is a sequence of vertices such that for . is the vertex sequence of the directed walk. An infinite directed walk is a sequence of edges of the same type described here, but with no first or last vertex, and a semi-infinite directed walk (or ray) has a first vertex but no last vertex.
Let {{nowrap|1=''G'' = (''V'', ''E'', ''ϕ'')}} be a directed graph. A finite directed walk is a sequence of edges for which there is a sequence of vertices such that for . is the vertex sequence of the directed walk. An infinite directed walk is a sequence of edges of the same type described here, but with no first or last vertex, and a semi-infinite directed walk (or ray) has a first vertex but no last vertex.
以一个有向图{{nowrap|1=''G'' = (''V'', ''E'', ''ϕ'')}}为例。有限有向步道是一系列的边 {{nowrap|(''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>)}}。{{nowrap|1=''ϕ''(''e''<sub>''i''</sub>) = (''v''<sub>''i''</sub>, ''v''<sub>''i'' + 1</sub>)}}对于{{nowrap|1=''i'' = 1, 2, …, ''n'' − 1}}. {{nowrap|(''v''<sub>1</sub>, ''v''<sub>2</sub>, …, ''v''<sub>''n''</sub>)}}是有向步道的顶点序列。无限有向步道是一个边序列，其类型与本文描述的相同，但没有第一个顶点或最后一个顶点，而半无限有向步道(或射线)有第一个顶点，但没有最后一个顶点。
* 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}}
一个加权有向图将一个值(权)与有向图中的每条边相关联。加权有向图中有向步道(或路径)的权是有向边权重的和。有时，“成本”或“长度”这两个词用来代替“权重”。
一个加权有向图将一个值(权)与有向图中的每条边相关联。加权有向图中有向步道(或路径)的权是有向边权重的和。有时，“成本”或“长度”这两个词用来代替“权重”。
== Examples 例子==
== Examples 例子==