知识卡片
平面图可画成无交叉边
平面图是能在平面上画出且边互不交叉的无向图。
图画得有交叉不等于图非平面,关键是是否存在一种无交叉画法。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第20章 基本图算法 · 查看原书依据
A planar graph is an undirected graph that can be drawn in the plane with no edges crossing. Euler proved that every planar graph has |E| < 3 |V|. Consider the following two operations on a planar graph G: INSERT(G, v, neighbors
参考来源
- 位置:《算法导论(第4版)》第20章《基本图算法》(OEBPS/chapter020.xhtml,文本字符[70000,74006))。
- 结论依据:问题20-5直接给出平面图定义;“能画出”表明是存在性而非固定画法。
- 原始内容:A planar graph is an undirected graph that can be drawn in the plane with no edges crossing. Euler proved that every planar graph has | E | < 3 | V |. Consider the following two operations on a planar graph G : I NSERT ( G , v , neighbors