(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 Sat Dec 27 11:54:35 2003.
HTML page formatted Tue Dec 27 09:53:26 2005.
Cite this as:
Paul E. Black, "weighted graph", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/weightedGraph.html
