原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
atrix representation of a graph G = (V, E) assumes that the vertices are numbered 1, 2, …
, |V| in some arbitrary manner. Then the adjacency-matrix representation of a graph G consists of a |V| × |V| matrix A = (aij) such that
Figures 20.1(c) and 20.2(c) are the adjacency matrices of the undirected and directed gra
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea