Introduction to graph theory
  • Some points before you start
  • Introduction
  • Lets learn some jargon part 1
  • Lets learn some jargon part 2
  • Remember the basics
  • Remember the basics
Graph representation
  • Adjacency matrix representation of a graph
  • Adjacency list representation of a graph
  • Comparison between two implementations
  • Graph representation
  • Construct the give graph using adj matrix and adj list representations
Graph traversing algorithms
  • Breadth first search
  • Breadth first search implementation
  • Depth first search
  • Predecessor sub graphs
  • Classification of edges in predecessor sub graph
  • Topological search of a directed graph
  • Topological sort implementation
  • Strongly connected component of a graph
  • Strongly connected component of a graph implementation
Shortest path in a graph
  • Shortest path algorithms introduction
  • Bellman ford algorithm
  • Bellman ford algorithm implementation
  • Shortest path in DAG
  • Dijkstra's algorithm of finding shortest path
  • Dijkstra's algorithm of finding shortest path explanation
  • Dijkstra's algorithm of finding shortest path implementation
Minimum spanning tree problem
  • Minimum spanning tree introduction
  • MST- Kruskal's algorithm introduction part 1
  • MST-Kruskal's algorithm introduction part 2
  • MST-Kruskal's algorithm implementation
  • MST-Prims algorithm introduction
  • MST-Prims algorithm implementation
Flow networks
  • Introduction to flow networks
  • Max flow min cut theorem