A graph having an edge from each vertex to every other vertex is called a ___________
(a) Tightly Connected
(b) Strongly Connected
(c) Weakly Connected
(d) Loosely Connected
The query is from Directed Graph in division Graph of Data Structures & Algorithms I
The question was posed to me in an interview.