NIST

weighted, directed graph

(definition)

Definition: A directed graph that has a weight, or numeric value, associated with each edge.

Generalization (I am a kind of ...)
directed graph, weighted 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 17 December 2004.
HTML page formatted Mon Feb 2 13:10:40 2015.

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