+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 relation

Enquiry is from Graph topic in section Graph of Data Structures & Algorithms I

This question was posed to me in a job interview.

1 Answer

+1 vote
by (737k points)
selected by
 
Best 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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...