Graph Analytics and Complexity

Youtube Playlist for Graph Analytics

Minimum Spanning Tree (MST) - Kruskal’s algorithm and Prim’s algorithm, and their Java codes https://www.slideshare.net/AnimeshChaturvedi/minimum-spanning-tree-mst-kruskal-and-prim-algorithms-and-their-java-codes


The Slide of Shortest Path, Bellman-Ford algorithm, Dijkstra’s algorithm, and Applications

https://www.slideshare.net/AnimeshChaturvedi/shortest-path-bellman-fords-algorithm-dijkastras-algorithm-their-java-coding-and-applications


The sides of the Complexity theory (N, NP, NP-Complete, NP-Hard)

https://www.slideshare.net/AnimeshChaturvedi/p-np-np-complete-and-nphard

Questions and Answers on Graph Analytics and Complexity https://www.slideshare.net/AnimeshChaturvedi/graph-analytics-and-complexity-questions-and-answers.


Lecture 1: Minimum Spanning Tree https://www.youtube.com/watch?v=cFU7fIjmPOM


Lecture 2: Krushkal's algorithm and Prim's algorithm https://www.youtube.com/watch?v=nGoXHvMF2Zs


Lecture 3: Java Coding of Kruskal's and Prim's Algorithm https://www.youtube.com/watch?v=Qh5lXL5s3a8


Lecture 4: Introduction to the Shortest Path https://youtu.be/te1OD7M-wK0


Lecture 5: Bellman Ford's Algorithm https://youtu.be/2luG7JfX1ps


Lecture 6: Dijkstra’s Algorithm https://youtu.be/Qnp0y-pneGM


Lecture 7: Java Code and Application for Shortest Path https://youtu.be/tHHTxogOJ_E


Lecture 8: Java code execution for Bellman-Ford's, Dijkstra's, Kruskal's, and Prim's algorithm https://youtu.be/VOC7_gf1WTU


Lecture 9: P, NP, NP Complete, and NP Hard https://youtu.be/LGkenjBrfkU


Lecture 10: Reductionism in Algorithms https://youtu.be/r-mDYfr5EHs


Lecture 11: NP Completeness and Cooks Theorem https://youtu.be/Q8uJiZ__aB0


Lecture 12: NP Complete and NP Hard Problems (C-SAT, 3-SAT, Clique, Vertex Cover, Hamiltonian Cycle, TSP) https://youtu.be/IgPMDYl0FwE


Lecture 13: Travelling Salesman Problem TSP https://youtu.be/GBEtb5D2zPs


Lecture 14. Travelling Salesman Problem (TSP) - Approximation Algorithms https://youtu.be/ODskidLXQNM

Lecture 15: PRIMES is in P (A hope for NP problems in P) https://youtu.be/4s5iyAERnOg


Lecture 16: Millennium Problems https://youtu.be/T9TfhQP_4_k


Lecture 17: Conclusions of Lecture series https://youtu.be/QtpCaDFbBg0