Paths in graphs....

Правка en1, от hp.1011, 2020-08-18 14:38:39

1) graph G consists of n nodes and m edges 2) G is a directed acyclic graph 3) n<=300 & m<=400 4) Number of simple paths from vertex 1 to vertex n is equal to k.

then what is the maximum value for k for the given constraints.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский hp.1011 2020-08-18 14:38:39 257 Initial revision (published)