知识卡片
邻接与入出度
有向边(u,v)从u出发并进入v,所以v邻接于u;出度数从顶点离开的边,入度数进入的边。
有向图总度数为入度加出度;无向图的度数是关联边数。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
- · 邻接与入出度
原书出处 · 1 处
- 附录B 集合等离散数学基础 · 查看原书依据
The degree of a vertex in an undirected graph is the number of edges incident on it. For example, vertex 2 in Figure B.2(b) has degree 2. A vertex whose degree is 0, such as vertex 4 in
参考来源
- 位置:《算法导论(第4版)》附录B《集合等离散数学基础》(OEBPS/appendix002.xhtml,文本字符[20000,25000))。
- 结论依据:附录B图、树的定义及相关例子;图B.2–B.5和对应公式图已查看。
- 原始内容:The degree of a vertex in an undirected graph is the number of edges incident on it. For example, vertex 2 in Figure B.2(b) has degree 2. A vertex whose degree is 0, such as vertex 4 in