知识卡片

普通读书笔记卡 · 3726.h

多重图与超图区别

理解等级:初级
  • 普通无向图的边连接两个不同顶点;
  • 多重图允许同一对顶点之间有多条边,也允许自环;
  • 超图的一条超边可连接任意顶点子集。

先确认边的定义,才能判断普通图的路径、度数或缩边规则能否直接沿用。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 附录B 集合等离散数学基础 · 查看原书依据

      There are two variants of graphs that you may occasionally encounter. A multigraph is like an undirected graph, but it can have both multiple edges between vertices (such as two distinct edges (u, v) and (u, v)) and self-loops. A hypergraph is like an undirected graph, but each hyperedge, rather than connecting two vertices, connects an arbitrary subset of vertices.

    参考来源

    - 位置:《算法导论(第4版)》附录B《集合等离散数学基础》(OEBPS/appendix002.xhtml,文本字符[25000,30000))。 - 结论依据:附录B.4在普通无向图和缩边定义后,明确对比多重图可有重边、自环,以及超图的超边连接任意顶点子集;最后一句只说许多普通图算法可改造使用,并未声称可原样套用。 - 原始内容:There are two variants of graphs that you may occasionally encounter. A multigraph is like an undirected graph, but it can have both multiple edges between vertices (such as two distinct edges ( u , v ) and ( u , v )) and self-loops. A hypergraph is like an undirected graph, but each hyperedge , rather than connecting two vertices, connects an arbitrary subset of vertices.