InterviewSolution
Saved Bookmarks
| 1. |
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 ConnectedThe query is from Directed Graph in division Graph of Data Structures & Algorithms IThe question was posed to me in an interview. |
|
Answer» Right answer is (a) Tightly Connected |
|