通路和路径Walks&Paths
Def: A walk is a sequence of vertices that are connected by edges.{ v 1 − v 2 − . . . − v k v_1-v_2-...-v_k v1−v2−...−vk} length k
Def: A path is a walk where all v i v_i vi's are different
环和回路Cycles& closed walks
Def: A closed walk is a walk which starts and ends at exactly the same vertex.(顶点)
v
0
−
v
1
−
v
2
−
.
.
.
−
v
k
=
v
0
v_0-v_1-v_2-...-v_k=v_0
v0−v1−v2−...−vk=v0
if k$\geq$3 and
v
0
,
v
1
,
v
2
,
.
.
.
,
v
k
−
1
v_0,v_1,v_2,...,v_{k-1}
v0,v1,v2,...,vk−1 are all different,then it is called cycle
树 Tree
Def: A definition is that a connectefd and acyclic (无环的)graph
叶节点 leaf
Def:
a leaf is a node with degree one in a tree
最小权重生成树
Def: The MST of an edge-weighted graph G is
the ST of G with the smallest possible sum of edge weights
AlgL Grow a subgraph step by step one edge at a time
at each step:
Add minimum weight edge keeps the subgraph acyclic
扫一扫
370
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
