# Directed Graph Edge

(Redirected from Arc)

An directed graph edge is a edge where its two graph nodes are in ordered relation (the parent node and the childnode).

**AKA:**Directed Link/Arc.**Context:**- It can (typically) be a member of a Directed Graph.
- It can (often) define a Graph Node Outlink from the Parent Node.
- It can (often) define a Graph Node Inlink into the Child Node.
- …

**Example(s):**- an edge that represents an airplane flight.
- a Hyperlink from one Webpage to another Webpage.
- a Backlink to one Webpage from another Webpage.
- a Concept Description Link from one Concept Description to another Concept Description.
- …

**Counter-Example(s):****See:**Antisymmetric Relation.