1.

Which of the following properties does a simple graph not hold?(a) Must be connected(b) Must be unweighted(c) Must have no loops or multiple edges(d) Must have no multiple edgesMy question is based upon Graph topic in portion Graph of Data Structures & Algorithms II got this question in homework.

Answer»

Right choice is (a) MUST be CONNECTED

The BEST EXPLANATION: A SIMPLE graph maybe connected or disconnected.



Discussion

No Comment Found

Related InterviewSolutions