(definition)
Definition: A connection between two vertices of a graph. In a weighted graph, each edge has an number, called a "weight." In a directed graph, an edge goes from one vertex, the source, to another, the target, and hence makes connection in only one direction.
Also known as arc.
Aggregate parent (I am a part of or used in ...)
directed graph, undirected graph, weighted graph.
See also hyperedge, in-degree, out-degree.
Note: That is, in a directed graph, 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 Mon Apr 19 14:37:40 2004.
HTML page formatted Mon Dec 19 14:07:47 2005.
Cite this as:
Paul E. Black, "edge", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/edge.html
