数学表达式: 从恐惧到单挑-作业day4

11.5 作业

图与网络

写出该无向图的邻接矩阵.

$$\mathbf{E}=\left[\begin{array}{cccc}0& 1& 1& 1\\ 1& 0& 1& 0\\ 1& 1& 0& 1\\ 1& 0& 1& 0\end{array}\right]$$

定义无向网络.

An undirected net is a tuple $G=(\mathbf{V},w)$, where $\mathbf{V}$ is the set of nodes, and $w:\mathbf{V}\times \mathbf{V}\to \mathbb{R}$ is the weight function where $w(v_i,v_j)$ is the weight of the edge $(v_i,v_j)$, and $w(v_i,v_j)=w(v_j,v_i)$.

12.4 作业

树

自己画一棵树, 将其元组各部分写出来 (特别是函数 $p$).

V = { A, B, C, D, E, F, G, H, I, J, K } \mathbf{V}=\{\textrm{A, B, C, D, E, F, G, H, I, J, K}\} V={A, B, C, D, E, F, G, H, I, J, K}
$r=\text{A}\in \mathbf{V}$
$p^0(\text{K})=\text{K},p^1(\text{K})=\text{A}$
$p^0(\text{J})=\text{J},p^1(\text{J})=\text{G},p^2(\text{J})=\text{E},p^3(\text{J})=\text{A}$
$p^0(\text{I})=\text{I},p^1(\text{I})=\text{G},p^2(\text{I})=\text{E},p^3(\text{I})=\text{A}$
$p^0(\text{H})=\text{H},p^1(\text{H})=\text{E},p^2(\text{H})=\text{A}$
$p^0(\text{F})=\text{F},p^1(\text{F})=\text{E},p^2(\text{F})=\text{A}$
$p^0(\text{D})=\text{D},p^1(\text{D})=\text{B},p^2(\text{D})=\text{A}$
$p^0(\text{C})=\text{C},p^1(\text{C})=\text{B},p^2(\text{C})=\text{A}$
$p^0(\text{A})=\text{A}$

针对该树, 将代码中的变量值写出来 (特别是 parent 数组).

public class Tree {
	/**
	 * 节点数. 表示节点 v_0 至 v_{n-1}.
	 */
	int n;
	
	/**
	 * 根节点. 0 至 n-1.
	 */
	int root;
	
	/**
	 * 父节点.
	 */
	int[] parent;

	/**
	 * 构造一棵树, 第一个节点为根节点, 其余节点均为其直接子节点, 也均为叶节点.
	 */
	public Tree(int paraN) {
		n = paraN;
		parent = new int[n];
		parent[0] = -1; // -1 即 \phi
	}// Of the constructor
}//Of class Tree

n=11
root=A
parent=[ -1, 0, 0, 0, 1, 1, 2, 2, 2, 7, 7 ]

13.4 作业

m-叉树

画一棵三叉树, 并写出它的 child 数组.

child[][]={{1,2,3},{-1,4,5},{6,7,8},{-1,-1,-1}}

按照本贴风格, 重新定义树. 提示: 还是应该定义 parent 函数, 字母表里面只有一个元素.

Let $\varphi$ be the empty node, a tree is a quadruple $T=(\mathbf{V},r,\Sigma ,p)$ where

• $\mathbf{V}$ is the set of nodes
• $r\in V$ is the root node;
• Σ = { 1 } \Sigma=\{1\} Σ={1} is the alphabet;
• p : V × Σ ∗ → V ∪ { ϕ } p:V \times \Sigma^*→V∪\{\phi\} p:V×Σ∗→V∪{ϕ} satisfying
  • ∀ v ∈ V , ∃ 1   s ∈ Σ ∗ , s . t . p { v , s } = r \forall v \in \mathbf{V},\exist1\ s\in \Sigma^*, s.t. p\{v,s\} = r ∀v∈V,∃1 s∈Σ∗,s.t.p{v,s}=r
  • p { r , s } = ϕ p\{r,s\} = \phi p{r,s}=ϕ