0 votes 0 votes What should be the maximum lenght of path consisting of n veritces ? Is, it should be n or n-1. lifeisshubh asked Jan 30, 2017 lifeisshubh 320 views answer comment Share Follow See 1 comment See all 1 1 comment reply Sushant Gokhale commented Jan 31, 2017 reply Follow Share If its circuit, its closed else its open . SO, I think n-1 0 votes 0 votes Please log in or register to add a comment.
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 Tesla! answered Mar 29, 2017 Tesla! comment Share Follow See all 0 reply Please log in or register to add a comment.