Graphs

• Create Graphs
  • Create Undirected Graph
  • Create Directed Graph
  • Edge Weighted Graph
  • Directed Edge Weighted Graph
  • Flow Network ( for max-flow min-cut problem)
• Graph Search
  • Depth First Search
  • Breadth First Search
• Graph Connectivity
  • Connected Components for undirected graph
  • Strongly Connected Components for directed graph
• Topological Sort
• Cyclic Graph Detection
  • Directed Cycle Detection
• Minimum Spanning Tree
  • Minimum Spanning Tree (Kruskal)
  • Minimum Spanning Tree (Lazy Prim)
• Shortest Path
  • Dijkstra
  • Shortest Path (Topological Sort)
  • Shortest Path (Bellman-Ford for positive and negative edge graph)
• Max-Flow-Min-Cut
  • MaxFlow MinCut (Ford-Fulkerson)