لبهی ِ سودار
Fr.: graphe orienté
In → graph theory, an edge where endpoints are
one is the head and the other is the tail. A directed edge
is specified as an ordered pair of → vertices,
u, v and is denoted by (u, v) or u→ v.
→ directed; → edge.