Weighted Graphs
← Back to Directed vs Undirected Graphs
Graphs where edges carry numerical values (weights/costs). Required for shortest path (Dijkstra, Bellman-Ford), minimum spanning tree (Prim’s, Kruskal’s), and network flow problems.
← Back to Directed vs Undirected Graphs
Graphs where edges carry numerical values (weights/costs). Required for shortest path (Dijkstra, Bellman-Ford), minimum spanning tree (Prim’s, Kruskal’s), and network flow problems.