1.定义无向网络.
答:Definition : A u n d i r e c t e d n e t \mathbf{undirected \ net} undirected net is a tuple G = ( V , w ) \mathbf{G} = ( \mathbf{V} , w ) G=(V,w) , where V \mathbf{V} V is the set of nodes, and w : V × V → R w :\mathbf{V} \times \mathbf{V} →\mathbb{R} w:V×V→R is the weight function where $w(v_i, v_j) is the weight of the edge ⟨ v i , v j ⟩ \langle v_i, v_j \rangle ⟨vi,vj⟩ and ∀ v i , v j ∈ V \forall v_i, v_j\in \mathbf{V} ∀vi,vj∈V, s.t. w ( v i , v j ) = w ( v j , v i ) w(v_i, v_j)=w(v_j, v_i) w(vi,vj)=w(vj,vi) .
2.自己画一棵树, 将其元组各部分写出来 (特别是函数 p p p ).
答:
V = { A , B , C , D , E , F , G , K } \mathbf{V}=\{A,B,C,D,E,F,G,K\} V={A,B,C,D,E,F,G,K}, r r r=A, p : V → V ∪ { ϕ } p: \mathbf{V}→\mathbf{V}∪\{ϕ\} p:V→V∪{ϕ} is the parent mapping satisfying.
3.针对该树, 将代码中的变量值写出来 (特别是 parent 数组).
答:
V
=
{
A
,
B
,
C
,
D
,
E
,
F
,
G
,
K
}
\mathbf{V}=\{A,B,C,D,E,F,G,K\}
V={A,B,C,D,E,F,G,K}
P
=
{
ϕ
,
(
A
B
)
,
(
B
D
)
,
(
B
E
)
,
(
D
K
)
,
(
A
C
)
,
(
C
F
)
,
(
C
G
)
,
(
A
B
D
)
,
(
A
B
E
)
,
(
B
D
K
)
,
(
A
C
F
)
,
(
A
C
G
)
,
(
A
B
D
K
)
}
\mathbf{P}=\{\phi,(AB),(BD),(BE),(DK),(AC),(CF),(CG),(ABD),(ABE),(BDK),(ACF),(ACG),(ABDK)\}
P={ϕ,(AB),(BD),(BE),(DK),(AC),(CF),(CG),(ABD),(ABE),(BDK),(ACF),(ACG),(ABDK)} .
4.画一棵三叉树, 并写出它的 child 数组.
答:
[
1
2
6
−
1
−
1
−
1
3
−
1
−
1
4
5
−
1
−
1
−
1
−
1
−
1
−
1
−
1
7
8
9
−
1
−
1
−
1
−
1
−
1
−
1
−
1
−
1
−
1
]
\left[\begin{matrix} 1&2&6\\ -1&-1&-1\\ 3&-1&-1\\ 4&5&-1\\ -1&-1&-1\\ -1&-1&-1\\ 7&8&9\\ -1&-1&-1\\ -1&-1&-1\\ -1&-1&-1\\ \end{matrix} \right]
⎣⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎡1−134−1−17−1−1−12−1−15−1−18−1−1−16−1−1−1−1−19−1−1−1⎦⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎤
5.按照帖子风格, 重新定义树. 提示: 还是应该定义 parent 函数, 字母表里面只有一个元素.
答:Let ϕ \phi ϕ be the empty node, a tree is a tetrad T = ( V , r , Σ , p ) T = (\mathbf{V}, r, \Sigma,p) T=(V,r,Σ,p)where
- Σ = { 1 } \Sigma={\{1\}} Σ={1} is the alphabet;
- V ≠ ∅ \mathbf{V} \ne \emptyset V=∅ is the set of nodes ;
- r ∈ V r \in \mathbf{V} r∈V is the root node;
-
V
→
V
∪
{
ϕ
}
\mathbf{V} \to \mathbf{V} \cup \{\phi\}
V→V∪{ϕ} is the parent mapping satisfying
p ( r ) = ϕ p(r) = \phi p(r)=ϕ;
∀ v ∈ V , ∃ 1 s ∈ Σ ∗ , n = ∣ s ∣ ≥ 0 , s t . p ( n ) ( v ) = r \forall v \in \mathbf{V}, \exist 1\ s \in\Sigma^*, n=|s|\ge 0 , st. p^{(n)}(v) = r ∀v∈V,∃1 s∈Σ∗,n=∣s∣≥0,st.p(n)(v)=r.
6.根据图、树、 m m m-叉树的学习, 谈谈你对元组的理解.
答:
- 元组可以容纳不同的数据类型,表示方式简单明了.
- 元组里的某些元素是关系的记录.
- 元组还可以存放元组元素之间的映射关系.