NIST

edge

(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


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 24 August 2017.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "edge", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 24 August 2017. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/edge.html