Graph

🔥 Graph Cost → Cost metrics on graphs (e.g., edge/path weights, MST total weight, cut capacity) are defined only given a graph’s vertices, edges, and representation; cost computation and optimization algorithms rely on the underlying graph structure.

🔥 Directed Graph → A directed_graph is a specialization of a graph where each edge has an orientation (u->v); it reuses the graph’s vertex/edge abstractions and common representations (adjacency lists/matrices) while adding direction-specific semantics and algorithms.

🌟 Graph Traversal →

🌟 Adjacency Matrix →

🌟 Adjacency List →

⚡️ Depth First Search →

⚡️ Breadth First Search →

Binary Tree →

Directed Acyclic Graph →

Topological Sort →

Network Flow →

Minimum Spanning Tree →

Prim Algorithm →

Adjacency Matrix →

Network Flow →

Shortest Path →

Topological Sort →

Kruskal Algorithm →

Undirected Graph →

Boruvka Algorithm →

Dijkstra Algorithm →

Introduction To Weighted Graphs →