原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
st-paths problem, thereby also solving the linear-programming problem. Linear programming
In the general linear-programming problem, the input is an m × n matrix A, an m-vector b, and an n-vector c. The goal is to find a vector x of n elements that maximizes the objective function subject to the m
constraints given by Ax ≤ b. The most popular method for solving linear programs is the s
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea