原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
r a strongly connected, directed graph—we can say that finding each edge takes Θ(E) time.
Adjacency lists can also represent weighted graphs, that is, graphs for which each edge has an associated weight given by a weight function w : E → ℝ. For example, let G = (V, E) be a weighted graph with weight function w. Then you can simply store the weight w(u, v) of the edge (u, v) ∈ E with vertex v in u’s adjacency list.
The adjacency-list representation is quite robust in that you can modify it to support ma
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea