Weighted graphs
Graphs where edges carry weights (costs, distances, capacities) representing relationship quantities. Weighted graphs model real-world problems where edges have associated values. Shortest path algorithms operate on weighted graphs finding minimum-cost paths.
Real World
Google Maps assigns weights to road edges representing travel time in minutes — Dijkstra's algorithm then finds the fastest route from your house to school, updating weights live with traffic data.
Exam Focus
If a question says 'shortest path', always clarify whether it means fewest edges (unweighted) or lowest total weight (weighted).
How well did you know this?