961
个编辑
更改
跳到导航
跳到搜索
第35行：
第35行： − + − − + − − − 设是一个有向图。有向电路是具有顶点序列的非空有向跟踪。 − − + +
→Definitions 定义
* 一个回路或环的长度指的是相关连边的数量。
* 一个回路或环的长度指的是相关连边的数量。
=== Directed circuit, cycle ===
=== Directed circuit, cycle 有向回路，环 ===
* A '''directed circuit''' is a non-empty [[Path (graph theory)#Directed walk, trail, path|directed trail]] in which the first and last vertices are repeated.{{sfn|Bender|Williamson|2010|p=164}}
* A '''directed circuit''' is a non-empty [[Path (graph theory)#Directed walk, trail, path|directed trail]] in which the first and last vertices are repeated.{{sfn|Bender|Williamson|2010|p=164}}
: Let {{nowrap|1=''G'' = (''V'', ''E'', ''ϕ'')}} be a directed graph. A directed circuit is a non-empty directed trail {{nowrap|(''e''<sub>1</sub>, ''e''<sub>2</sub>, …, ''e''<sub>''n''</sub>)}} with a vertex sequence {{nowrap|(''v''<sub>1</sub>, ''v''<sub>2</sub>, …, ''v''<sub>''n''</sub>, ''v''<sub>1</sub>)}}.
: Let {{nowrap|1=''G'' = (''V'', ''E'', ''ϕ'')}} be a directed graph. A directed circuit is a non-empty directed trail {{nowrap|(''e''<sub>1</sub>, ''e''<sub>2</sub>, …, ''e''<sub>''n''</sub>)}} with a vertex sequence {{nowrap|(''v''<sub>1</sub>, ''v''<sub>2</sub>, …, ''v''<sub>''n''</sub>, ''v''<sub>1</sub>)}}.
Let be a directed graph. A directed circuit is a non-empty directed trail with a vertex sequence
Let be a directed graph. A directed circuit is a non-empty directed trail with a vertex sequence .
* A '''directed cycle''' or '''simple directed circuit''' is a directed circuit in which the only repeated vertices are the first and last vertices.{{sfn|Bender|Williamson|2010|p=164}}
* A '''directed cycle''' or '''simple directed circuit''' is a directed circuit in which the only repeated vertices are the first and last vertices.{{sfn|Bender|Williamson|2010|p=164}}
* 有向回路是一个非空有向路径，其中第一个和最后一个顶点重复出现。设有向图G =（V，E，ϕ），其有向回路是具有顶点序列（v1，v2，...，vn，v1）的非空有向路径（e1，e2，……，en）。
* 在一个有向环或简单有向回路中，唯一重复的顶点是起始点和最终点
== Chordless cycles ==
== Chordless cycles ==