In a directed graph, edge e=(u,v) represents an ordered pair where u is the tail (start/predecessor) and v is the head (end/successor). This directionality means u is adjacent to v, but v is not adjacent to u in directed graphs (unless there's a reverse edge).