84669 person learning
152542 person learning
20005 person learning
5487 person learning
7821 person learning
359900 person learning
3350 person learning
180660 person learning
48569 person learning
18603 person learning
40936 person learning
1549 person learning
1183 person learning
32909 person learning
ringa_lee
First of all, it is very clear on the Internet, even Baidu Encyclopedia.
If i->k + k->j is shorter than i->j, it means that the former is the shortest path at the current stage. Do you understand this?
Essentially it is dynamic programming, just find the previous one in stages according to i, j.
I don’t understand reference dynamic programming
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
First of all, it is very clear on the Internet, even Baidu Encyclopedia.
If i->k + k->j is shorter than i->j, it means that the former is the shortest path at the current stage. Do you understand this?
Essentially it is dynamic programming, just find the previous one in stages according to i, j.
I don’t understand reference dynamic programming