Simple is path in which all vertices are distinct excluding initial & final vertices - Data Structure

Q.  A path in which all the vertices are distinct excluding the initial and final vertices is known as _________. (Data Structure)
- Published on 27 Aug 15

a. Simple
b. Compound
c. Complex
d. Distinct

ANSWER: Simple

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 21 Nov 15
    A path in which all the vertices are distinct excluding the initial and final vertices is known as simple path.
    If a path starts and ends at the same vertex, then it is called a closed path. If a path does not visit any vertex more than once, then it is a simple path. A path that is both simple and closed is said to be a cycle in a graph.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲