(definition)
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 ...)
labeled graph.
Specialization (... is a kind of me.)
weighted, directed graph.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 27 December 2003.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "weighted graph", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 27 December 2003. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/weightedGraph.html
