1.

Which of the following statements for a simple graph is correct?(a) Every path is a trail(b) Every trail is a path(c) Every trail is a path as well as every path is a trail(d) Path and trail have no relationEnquiry is from Graph topic in section Graph of Data Structures & Algorithms IThis question was posed to me in a job interview.

Answer»

The CORRECT answer is (a) Every path is a TRAIL

Best EXPLANATION: In a walk if the vertices are distinct it is called a path, WHEREAS if the edges are distinct it is called a trail.



Discussion

No Comment Found

Related InterviewSolutions