Need assistance in a problem.

Правка en1, от Amiya-05, 2024-10-25 16:26:42

Hello ! I have come across a graph problem which has n(<=16) nodes (And It is connected) and we need to find the MAX NUMBER of nodes on any possible path (Path should not contain cycles) between any two pair of nodes in the graph . How can I solve it ? Can anybody suggest any idea ?

Теги graphs, paths

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Amiya-05 2024-10-25 16:26:42 313 Initial revision (published)