Let G be an undirected graph. Let u and v be two vertices in G. Then u and v are called ____ if there is an edge from one to the other.
A. adjacent
B. weighted
C. connected
D. shortest path
Answer: A
Computer Science & Information Technology