320 views
0 votes
0 votes
What should be the maximum lenght of path consisting of n veritces ?

Is, it should be n or n-1.

1 Answer

0 votes
0 votes

If by maximum you mean best possible case then it answer is N

Maximum is possible if there is an circuit

If Graph does not have any circuit then maximum is N-1.

Eg: Chain of N vertices

Related questions

0 votes
0 votes
3 answers
2
Bongbirdie asked Apr 1, 2017
624 views
What is the difference between path and Euler path?
0 votes
0 votes
0 answers
3
Malusi asked Jan 12
88 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...