Definition: A graph having a weight, or number, associated with each edge. Some algorithms require all weights to be nonnegative, integral, positive, etc.
Also known as edge-weighted graph.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
weighted, directed graph.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 27 December 2003.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "weighted graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 27 December 2003. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/weightedGraph.html