~Get Your Files Here !

  1. Introduction

   1. Introduction to graph theory.srt

   2. [IMPORTANT] Before we start.html

   4. Terminology and types of graphs.mp4

   4.1 types and terms.pptx

  2. Graph representation

   1. Adjacency list representation.srt

   1.2 graph_adj_list.py

   2. Adjacency matrix representation.mp4

   2.1 adjacency matrix.pptx

   2.3 GraphAdjMat.java

   3. Adjacency list vs adjacency matrix.srt

   4. Quiz Adjacency lists and matrices.html

  3. Graph traversal

   1. Depth-first search (DFS) algorithm.srt

   1.2 dfs_visualization.py

   1.4 dfs.py

   3. Solution Path exists in a graph.mp4

   3.1 dfs path exists.pptx

   3.3 DfsPathExists.java

   4. Breadth-first search (BFS) algorithm.srt

   4.2 Bfs.java

   4.4 breadth first search.pptx

   6. Solution Minimum edges from start to end.mp4

   6.1 bfs path exists.pptx

   6.3 BfsMinEdges.java

   7. DFS and BFS in implicit graphs.srt

   7.2 BfsGrid.java

   7.4 dfs_grid.py

   7.6 Flood fill algorithm YouTube video.html

  4. Topological sort

   1. What is topological sort.srt

   2. DFS-based topological sort algorithm.mp4

   2.1 topological sort dfs.pptx

   2.3 TopsortDfs.java

   3. BFS-based topological sort algorithm (Kahn's algorithm).srt

   3.2 topsort_bfs.py

   4. Problem Find all possible recipes.html

   5. Solution Find all possible recipes problem.srt

   5.2 find_possible_recipes.py

   6. Quiz Topological sort.html

  5. Shortest path problem

   1. Introduction.srt

   2. Dijkstra's algorithm.mp4

   2.1 Binary heaps YouTube video.html

   2.3 dijkstra.py

   2.5 FibonacciHeap.java

   3. Bellman-Ford algorithm.mp4

   3.1 bellman ford.pptx

   3.3 BellmanFord.java

   3.5 Tuple.java

   4. Floyd-Warshall algorithm.srt

   4.2 floyd_warshall.py

   5. Johnson's algorithm.mp4

   5.1 Johnson.java

   5.3 johnsons.pptx

   6. Shortest path in unweighted graphs.srt

   6.2 shortest_path_unweighted.py

   7. Shortest path in directed acyclic graphs.mp4

   7.1 dag shortest path.pptx

   7.3 ShortestPathDAG.java

  6. Trees

   1. What is a tree.srt

   1.2 IsTree.java

   2. Out-trees (arborescence) and graph to out-tree conversion.mp4

   2.1 graph to out-tree.pptx

   2.3 ToOutTree.java

   3. Solution All nodes distance k in a tree problem.srt

   3.2 DistanceK.java

   4. Quiz What is a tree.html

  7. Minimum spanning trees

   1. What is a (minimum) spanning tree.srt

   1.2 FindSpanningTree.java

   2. Prim's algorithm.mp4

   2.1 FibonacciHeap.java

   2.3 prim.pptx

   2.5 Tuple.java

   3. Kruskal's algorithm.srt

   3.2 DisjointSet.java

   3.4 kruskal.pptx

   4. Problem Min cost to connect all points.html

   5. Solution Min cost to connect all points problem.srt

   5.2 min_cost_connect.py

   6. Quiz Minimum spanning trees.html

  8. Eulerian and Hamiltonian pathscycles

   1. What is a Eulerian pathcycle.srt

   2. Hierholzer's algorithm.mp4

   2.1 Hierholzer.java

   2.3 hierholzer.py

   4. Solution Reconstruct itinerary.mp4

   4.1 reconstruct itinerary.pptx

   4.3 ReconstructItinerary.java

   5. What is a Hamiltonian pathcycle.srt

   6. Hamiltonian pathcycle finding algorithms.mp4

   6.1 hamiltonian backtracking.pptx

   6.3 HamiltonianBacktracking.java

  9. Graph coloring

   1. Introduction to graph coloring.srt

   2. Checking 2-colorability (bipartite graph).mp4

   2.1 is bipartite.pptx

   2.3 TwoColorability.java

   3. Checking k-colorability with backtracking.srt

   3.2 k_colorability.py

   4. Greedy coloring.mp4

   4.1 greedy coloring.pptx

   4.3 GreedyColoring.java

   5. Heuristics (Welsh-Powell, DSatur).srt

   5.2 DSatur.java

   5.4 welsh_powell.py

   6. Problem Sudoku solver.html

   7. Solution Let's make a Sudoku solver.srt

   7.2 sudoku_solver.py

   8. Quiz Graph coloring.html

  Bonus Resources.txt