ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
best lectures of algorithm I have ever listened.
Value [4][5] in W0 is 3 not value[4][3]
4 and 3 are not directly connected so the value should be infinity
yeah. this is a printing mistake.
thanks for the affirmation
what does " all pairs shortest paths" mean
It means that we are finding the shortest path between any 2 vertices in the graph , kind of like a dynamic solution.
Single source shortest path repeated on all vertices as sources. It can be thought as the shortest way to reach every other vertex from every vertex
best lectures of algorithm I have ever listened.
Value [4][5] in W0 is 3 not value[4][3]
4 and 3 are not directly connected so the value should be infinity
yeah. this is a printing mistake.
thanks for the affirmation
what does " all pairs shortest paths" mean
It means that we are finding the shortest path between any 2 vertices in the graph , kind of like a dynamic solution.
Single source shortest path repeated on all vertices as sources. It can be thought as the shortest way to reach every other vertex from every vertex