issues
search
walkccc
/
CLRS
📚 Solutions to Introduction to Algorithms Third Edition
https://walkccc.me/CLRS
MIT License
4.62k
stars
1.25k
forks
source link
Update 29.2.md
#514
Open
leverimmy
opened
2 weeks ago
leverimmy
commented
2 weeks ago
Fixed typo.
Changed a formula. It should be $$\sum
{i \in [k]} f
{uv}^i \le c(u, v) \text{ for each edge } (u, v).$$