Learning content : network flow
Completed today the number of questions (does not include multi-school) :
Today's reading situations : None
Summarize learning algorithm
There are minimum cost network flow and upper and lower bounds of the feasible flow
Today do question summary
https://www.cnblogs.com/MengX/p/11370478.html
https://www.cnblogs.com/MengX/p/11369209.html
Today's experience:
Learned flow upper and lower bounds Network
Tomorrow tasks:
Tomorrow the entire network flow problems at school and more