← Glossary
What does "weighted graph" mean in programming?
weighted graph is one of the most common terms in software development. This guide explains what it means, how it is used in practice, and why it matters, with real examples from the developer world.
Definition
A graph where each edge carries a numeric weight representing a cost, distance, or capacity. Shortest-path algorithms like Dijkstra's operate on weighted graphs to find the minimum-cost route between vertices.
Example
"A flight-route graph is weighted: each edge carries the distance in kilometers between airports."
Related terms
Ready to practice your English at work?
Lingua-e has interactive exercises built around real developer conversations: standups, code reviews, retrospectives, and more. Practice until it comes naturally.
Try Lingua-e for free