Outgoing Edge

Definition

In a Directed Graph, an outgoing edge from a node $v$ is an edge of the form $(v,u)$ for some node $u$.

The node $v$ is called the source or tail of the edge, and $u$ is called the target or head.

Related Concepts

• Incoming Edge: The dual concept, edges of the form $(u,v)$ pointing to $v$.
• Degree: The out-degree of a node is the number of outgoing edges.
• Path: Paths in directed graphs follow outgoing edges.