Home »
Unlabelled »
If every node u in G is adjacent to every other node v in G, A graph is said to be | Data Stuctures
If every node u in G is adjacent to every other node v in G, A graph is said to be | Data Stuctures
A. isolated
B. complete
C. finite
D. strongly connected
Ans: B
No comments:
Post a Comment