原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
utes min(u) for all vertices u ∈ V. 20-5 Inserting and querying vertices in planar graphs
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
) inserts a new vertex v into G, where neighbors is an array (possibly empty) of vertices
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea