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

Implementation

build, traverse, top sort, etc. weighted, directed graph (Java)
Go to the Dictionary of Algorithms and Data Structures home page.

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

Entry modified Fri Dec 17 12:25:07 2004.
HTML page formatted Mon Dec 19 14:07:51 2005.

Cite this as:
Paul E. Black, "weighted, directed graph", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/weightedDigraph.html

to NIST home page