NIST

weighted graph

(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


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 27 December 2003.
HTML page formatted Mon Nov 18 10:44:10 2013.

Cite this as:
Paul E. Black, "weighted graph", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 27 December 2003. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/weightedGraph.html