(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 E. Black.

Entry modified 19 April 2004.

HTML page formatted Fri Mar 25 16:20:34 2011.

Cite this as:

Paul E. Black, "edge", in
*Dictionary of Algorithms and Data
Structures* [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/edge.html