(definition)
Definition: (1) A vertex of a directed graph with no incoming edges. More formally, a vertex with in-degree 0. (2) The vertex from which an edge of a directed graph leaves.
See also sink, supersource, flow network, critical path problem, multi-commodity flow, (2) target.
Note: Conceptually, an origin of whatever is directed in the graph. In UML, a producer of data in a design.
(2) That is, an edge goes from the source to the target.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:54:45 2004.
HTML page formatted Wed Oct 26 09:48:10 2005.
Cite this as:
Paul E. Black, "source", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/source.html
