原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
presented in this book assume that an input graph is represented in adjacency-list form.
You might prefer an adjacency-matrix representation, however, when the graph is dense—|E| is close to |V|2—or when you need to be able to tell quickly whether there is an edge connecting two given vertices.
For example, two of the all-pairs shortest-paths algorithms presented in Chapter 23 assum
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea