原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
in-degree |V| – 1 and out-degree 0—in O(V) time, given an adjacency matrix for G. 20.1-7
The incidence matrix of a directed graph G = (V, E) with no self-loops is a |V| × |E| matrix B = (bij) such that
Describe what the entries of the matrix product BBT represent, where BT is the transpose
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea