Definition
Two vertices in a graph are adjacent if there is an edge connecting them.
In an Undirected Graph, adjacency is symmetric: if vertex is adjacent to vertex , then is adjacent to .
In a Directed Graph, adjacency depends on edge direction: vertex is adjacent to vertex if there exists a directed edge from to .