# Algorithmic Graph Theory and Data Structures

- Institution: IIT Kharagpur
- Department: Computer Science and Engineering
- Teacher: Prof. Sourav Mukhopadhyay
- Level: Undergraduate
- Language: English
- Subjects: Computer science, Engineering
- Source: [NPTEL](https://nptel.ac.in/courses/106105847)
- Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.)
- Syllabus: [at the source](https://nptel.ac.in/courses/106105847)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

## Lectures

1. [Lecture No - 01 : Introduction](https://invisiblenetwork.ai/learn/nptel/106105847/64ad90b4b170) (Video)
2. [Lecture No - 02 : Analysis of Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/1d2ad3e2eb39) (Video)
3. [Lecture No - 03 : Time Complexity](https://invisiblenetwork.ai/learn/nptel/106105847/36822b130e92) (Video)
4. [Lecture No - 04 : Merge Sort](https://invisiblenetwork.ai/learn/nptel/106105847/9a16d9c5a42a) (Video)
5. [Lecture No - 05 : Solving the recurrences](https://invisiblenetwork.ai/learn/nptel/106105847/cea5e003ac2b) (Video)
6. [Lecture No - 06 : Solving the recurrences (Cont…)](https://invisiblenetwork.ai/learn/nptel/106105847/7bee027fc503) (Video)
7. [Lecture No - 07 : Divide and Conquer Algorithms](https://invisiblenetwork.ai/learn/nptel/106105847/e4ebcb99e1f4) (Video)
8. [Lecture No - 08 : Fibonacci numbers and Matrix multiplication](https://invisiblenetwork.ai/learn/nptel/106105847/96806fa694e5) (Video)
9. [Lecture No - 09 : Quicksort](https://invisiblenetwork.ai/learn/nptel/106105847/3592a29d8b2b) (Video)
10. [Lecture No - 10 : Randomized Quicksort](https://invisiblenetwork.ai/learn/nptel/106105847/7060e3bd69eb) (Video)
11. [Lecture No - 11 : Heapsort](https://invisiblenetwork.ai/learn/nptel/106105847/86f66a992421) (Video)
12. [Lecture No - 12 : Linear time sorting](https://invisiblenetwork.ai/learn/nptel/106105847/a836d4426874) (Video)
13. [Lecture No - 13 : Linear time sorting (Cont…)](https://invisiblenetwork.ai/learn/nptel/106105847/e6bced42b442) (Video)
14. [Lecture No - 14 : Order Statistics](https://invisiblenetwork.ai/learn/nptel/106105847/69dde2c7ad2a) (Video)
15. [Lecture No - 15 : Order Statistics (Cont…)](https://invisiblenetwork.ai/learn/nptel/106105847/5b56cb14dfaa) (Video)
16. [Lecture No - 16 : Hash Function](https://invisiblenetwork.ai/learn/nptel/106105847/d1ea1b6cce72) (Video)
17. [Lecture No - 17 : Open Addressing Hashing](https://invisiblenetwork.ai/learn/nptel/106105847/854fd9b91760) (Video)
18. [Lecture No - 18 : Universal Hash Functions](https://invisiblenetwork.ai/learn/nptel/106105847/e85867487e87) (Video)
19. [Lecture No - 19 : Perfect Hashing](https://invisiblenetwork.ai/learn/nptel/106105847/bd835de351e8) (Video)
20. [Lecture No - 20 : Heap](https://invisiblenetwork.ai/learn/nptel/106105847/60b9641cdbec) (Video)
21. [Lecture No - 21 : Binary Search Tree](https://invisiblenetwork.ai/learn/nptel/106105847/75f1d39d1d52) (Video)
22. [Lecture No - 22 : Binary Search Tree Sort](https://invisiblenetwork.ai/learn/nptel/106105847/713e7fc77d59) (Video)
23. [Lecture No - 23 : Randomly build binary search tree](https://invisiblenetwork.ai/learn/nptel/106105847/b683da87fb95) (Video)
24. [Lecture No - 24 : Balanced Binary Search Tree](https://invisiblenetwork.ai/learn/nptel/106105847/1731f0fed338) (Video)
25. [Lecture No - 25 : Red Black Tree](https://invisiblenetwork.ai/learn/nptel/106105847/42707087a3e9) (Video)
26. [Lecture No - 26 : Data-structure augmentation](https://invisiblenetwork.ai/learn/nptel/106105847/b62367d6a107) (Video)
27. [Lecture No - 27 : Interval Trees](https://invisiblenetwork.ai/learn/nptel/106105847/6dd7a59509d0) (Video)
28. [Lecture No - 28 : Fixed Universe Successor](https://invisiblenetwork.ai/learn/nptel/106105847/b11324c42e2f) (Video)
29. [Lecture No - 29 : Van Emde Boas](https://invisiblenetwork.ai/learn/nptel/106105847/4fbf07f862e0) (Video)
30. [Lecture No - 30 : Computational Geometry](https://invisiblenetwork.ai/learn/nptel/106105847/4e8475137b81) (Video)
31. [Lecture No - 31 : Orthogonal Range Tree](https://invisiblenetwork.ai/learn/nptel/106105847/7bd3b0f13e67) (Video)
32. [Lecture No - 32 : Amortized Analysis](https://invisiblenetwork.ai/learn/nptel/106105847/8cde2580c55e) (Video)
33. [Lecture No - 33 : Amortized Analysis (Cont...)](https://invisiblenetwork.ai/learn/nptel/106105847/00ba68c03ee9) (Video)
34. [Lecture No - 34 : Disjoint Set](https://invisiblenetwork.ai/learn/nptel/106105847/733aa68349c5) (Video)
35. [Lecture No - 35 : Disjoint Set (Cont...)](https://invisiblenetwork.ai/learn/nptel/106105847/fcdd70a0674d) (Video)
36. [Lecture No - 36 : Dynamic Programming (DP)](https://invisiblenetwork.ai/learn/nptel/106105847/dfd77fa75702) (Video)
37. [Lecture No - 37 : Introduction to Graphs](https://invisiblenetwork.ai/learn/nptel/106105847/9f0ff4bce012) (Video)
38. [Lecture No - 38 : Minimum Spanning Tree](https://invisiblenetwork.ai/learn/nptel/106105847/15614d06d644) (Video)
39. [Lecture No - 39 : Prim’s Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/154be98cd5f1) (Video)
40. [Lecture No - 40 : Kruskal Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/a034dc84e7e1) (Video)
41. [Lecture No - 41 : Graph Search Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/1da44ff4e8b1) (Video)
42. [Lecture No - 42 : Depth First Search (DFS)](https://invisiblenetwork.ai/learn/nptel/106105847/03a819a38509) (Video)
43. [Lecture No - 43 : Application of DFS](https://invisiblenetwork.ai/learn/nptel/106105847/2056bcefc6f5) (Video)
44. [Lecture No - 44 : Breadth-First Search (BFS)](https://invisiblenetwork.ai/learn/nptel/106105847/bc981a6bf163) (Video)
45. [Lecture No - 45 : Shortest Path Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/73d959eb17b2) (Video)
46. [Lecture No - 46 : Dijkstra’s Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/bb5d06a94bef) (Video)
47. [Lecture No - 47 : Bellman-Ford Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/968ad93e9921) (Video)
48. [Lecture No - 48 : Bellman-Ford (Cont…)](https://invisiblenetwork.ai/learn/nptel/106105847/b9c50c99f014) (Video)
49. [Lecture No - 49 : Application of Bellman-Ford](https://invisiblenetwork.ai/learn/nptel/106105847/40c23e1f1d08) (Video)
50. [Lecture No - 50 : Johnson’s Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/59604e848622) (Video)
51. [Lecture No - 51 : All Pairs Shortest Paths](https://invisiblenetwork.ai/learn/nptel/106105847/123f9bfbceac) (Video)
52. [Lecture No- 52 : Floyd-Warshall](https://invisiblenetwork.ai/learn/nptel/106105847/c2fdc02d1c10) (Video)
53. [Lecture No-53 : Flow Network](https://invisiblenetwork.ai/learn/nptel/106105847/e162819c6e7a) (Video)
54. [Lecture No-54 : Flow Network (Cont...)](https://invisiblenetwork.ai/learn/nptel/106105847/efa024439490) (Video)
55. [Lecture No- 55 : Ford-Fulkerson max-flow](https://invisiblenetwork.ai/learn/nptel/106105847/6a9e5e816161) (Video)
56. [Lecture No - 56 : Maximum Flow, Min Cut Theorem](https://invisiblenetwork.ai/learn/nptel/106105847/98a4943de664) (Video)
57. [Lecture No- 57 : Edmonds-Karp Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/23b170351500) (Video)
58. [Lecture No-58 : Edmonds-Karp Max Flow Algorithm](https://invisiblenetwork.ai/learn/nptel/106105847/5b45bcb19bad) (Video)
59. [Lecture No-59 : Dynamic Programming-II](https://invisiblenetwork.ai/learn/nptel/106105847/6b3fa6dd877f) (Video)
60. [Lecture No- 60 : Computational Complexity](https://invisiblenetwork.ai/learn/nptel/106105847/477bb56bd3e3) (Video)