原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
are undirected and that the vertices are numbered from 1 to 7 as in a binary heap. 20.1-3
The transpose of a directed graph G = (V, E) is the graph GT = (V, ET), where ET = {(v, u) ∈ V × V : (u, v) ∈ E}. That is, GT is G with all its edges reversed.
Describe efficient algorithms for computing GT from G, for both the adjacency-list and ad
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea