Learn · Algorithmic Graph Theory and Data Structures

Lecture 51 of 60Week 11

Lecture No - 51 : All Pairs Shortest Paths

Prof. Sourav Mukhopadhyay · IIT Kharagpur

Credits and licence

From
Algorithmic Graph Theory and Data Structures, IIT Kharagpur (at NPTEL)
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
Tweens profiles and older. How courses are placed

All the lectures

  1. Lecture No - 01 : Introduction Video
  2. Lecture No - 02 : Analysis of Algorithm Video
  3. Lecture No - 03 : Time Complexity Video
  4. Lecture No - 04 : Merge Sort Video
  5. Lecture No - 05 : Solving the recurrences Video
  6. Lecture No - 06 : Solving the recurrences (Cont…) Video
  7. Lecture No - 07 : Divide and Conquer Algorithms Video
  8. Lecture No - 08 : Fibonacci numbers and Matrix multiplication Video
  9. Lecture No - 09 : Quicksort Video
  10. Lecture No - 10 : Randomized Quicksort Video
  11. Lecture No - 11 : Heapsort Video
  12. Lecture No - 12 : Linear time sorting Video
  13. Lecture No - 13 : Linear time sorting (Cont…) Video
  14. Lecture No - 14 : Order Statistics Video
  15. Lecture No - 15 : Order Statistics (Cont…) Video
  16. Lecture No - 16 : Hash Function Video
  17. Lecture No - 17 : Open Addressing Hashing Video
  18. Lecture No - 18 : Universal Hash Functions Video
  19. Lecture No - 19 : Perfect Hashing Video
  20. Lecture No - 20 : Heap Video
  21. Lecture No - 21 : Binary Search Tree Video
  22. Lecture No - 22 : Binary Search Tree Sort Video
  23. Lecture No - 23 : Randomly build binary search tree Video
  24. Lecture No - 24 : Balanced Binary Search Tree Video
  25. Lecture No - 25 : Red Black Tree Video
  26. Lecture No - 26 : Data-structure augmentation Video
  27. Lecture No - 27 : Interval Trees Video
  28. Lecture No - 28 : Fixed Universe Successor Video
  29. Lecture No - 29 : Van Emde Boas Video
  30. Lecture No - 30 : Computational Geometry Video
  31. Lecture No - 31 : Orthogonal Range Tree Video
  32. Lecture No - 32 : Amortized Analysis Video
  33. Lecture No - 33 : Amortized Analysis (Cont...) Video
  34. Lecture No - 34 : Disjoint Set Video
  35. Lecture No - 35 : Disjoint Set (Cont...) Video
  36. Lecture No - 36 : Dynamic Programming (DP) Video
  37. Lecture No - 37 : Introduction to Graphs Video
  38. Lecture No - 38 : Minimum Spanning Tree Video
  39. Lecture No - 39 : Prim’s Algorithm Video
  40. Lecture No - 40 : Kruskal Algorithm Video
  41. Lecture No - 41 : Graph Search Algorithm Video
  42. Lecture No - 42 : Depth First Search (DFS) Video
  43. Lecture No - 43 : Application of DFS Video
  44. Lecture No - 44 : Breadth-First Search (BFS) Video
  45. Lecture No - 45 : Shortest Path Algorithm Video
  46. Lecture No - 46 : Dijkstra’s Algorithm Video
  47. Lecture No - 47 : Bellman-Ford Algorithm Video
  48. Lecture No - 48 : Bellman-Ford (Cont…) Video
  49. Lecture No - 49 : Application of Bellman-Ford Video
  50. Lecture No - 50 : Johnson’s Algorithm Video
  51. Lecture No - 51 : All Pairs Shortest Paths Video
  52. Lecture No- 52 : Floyd-Warshall Video
  53. Lecture No-53 : Flow Network Video
  54. Lecture No-54 : Flow Network (Cont...) Video
  55. Lecture No- 55 : Ford-Fulkerson max-flow Video
  56. Lecture No - 56 : Maximum Flow, Min Cut Theorem Video
  57. Lecture No- 57 : Edmonds-Karp Algorithm Video
  58. Lecture No-58 : Edmonds-Karp Max Flow Algorithm Video
  59. Lecture No-59 : Dynamic Programming-II Video
  60. Lecture No- 60 : Computational Complexity Video