1- Bellman-Ford algorithm: Application to an example
93,305 views
About :
This video assumes that you have already made an effort to read the handout and in particular the concepts of directed graphs, shortest paths, absorbing circuits. This is only an example of application of the algorithm. Some comments on this video: For the sake of simplicity, we have not included the recording of the predecessors (matrix ???? of the poly) which allows to reconstruct an optimal solution. At the moment when ????[????,????] is updated, we can keep the memory that on the new shortest path, the predecessor of ???? is ???? and record: ????[????,????]=???? In the graph used as an example, the source vertex ???? has no predecessors. It could have some and if there is an absorbing circuit passing through ???? then the value of ????[????,????] could become negative. The algorithm remains correct. Since ???? has no predecessors in this example, the value ????[????,????] will remain at 0 throughout. The set of predecessors is sometimes noted Γ−1(????) or Γ−(????). We have retained Γ−(????) in this video. Another short video on Bellman-Ford: Understanding the optimality of the algorithm: • 2- Bellman-Ford algorithm: Ideas ... Contact: Nicolas Catusse and Hadrien Cambazard
440,143 views 3 days ago
440,143 views 3 days ago
1,121,544 views 3 days ago
384,005 views 1 day ago
Google AdSense
336 x 280
336 x 280
Up Next
frc
111,787 views
7 days ago
7 days ago
alanzoka
2,311,681 views
4 months ago
4 months ago
Clark
761,050 views
2 weeks ago
2 weeks ago
Um Gamer Aleatório
4,587,469 views
6 years ago
6 years ago
Sim Sou Silva
232,488 views
5 months ago
5 months ago
o Melhor Das Streams
3,352,358 views
4 years ago
4 years ago
Itachi Bostero
1,873,531 views
1 year ago
1 year ago
БУЛДЖАТь
1,325,378 views
1 year ago
1 year ago
Google AdSense
336 x 280
336 x 280