原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
es between two vertices replaced by a single edge and with all self-loops removed. 20.1-5
The square of a directed graph G = (V, E) is the graph G2 = (V, E2) such that (u, v) ∈ E2 if and only if G contains a path with at most two edges between u and v.
Describe efficient algorithms for computing G2 from G for both the adjacency-list and adj
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea