(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Tue Oct 9 11:43:47 2007.
Cite this as:
Paul E. Black, "weighted, directed graph", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/weightedDigraph.html