基础知识
图的概念
1.设图G=(V,E),
u
,
v
∈
V
u,v\in V
u,v∈V,
(
u
,
v
)
∈
E
(u,v)\in E
(u,v)∈E
若u=v,称e为环若(u,v)不止一条,称这些边为平行边。平行边的条数称为重数
无环和平行边的图称为简单图。
2.
Eulerian path:Traverse all the edges exactly once without returning to the starting vertex.
Eulerian circuits:Traverse all the edges exactly once and return to the starting vertex.
3.
arity /'ærɪti/ 元
E.g. n-ary tree
错题
1 有向/无向
A.有向完全图*2
2可简单图化
AB Prove
3哈密尔顿图
需要包含哈密尔顿回路
4判断
5.Find the hamiltonian circuit.
Hint:one-way in and one-way out is needed.