Simple Cycles

Правка en1, от HalfFragment, 2019-05-28 10:55:39
1. Given an undirected weighted graph and two node s, t. How one can print any simple cycle that passes through both s and t or say no such cycle exist?

2. If more than one such cycle exist then How one can print cycle with minimum weight among them??

Is it possible to solve these problem in linear time?? Please suggest me optimal solution for these problem...It will be much helpful if one can provide code also.
Теги #graph theory, #network flow

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский HalfFragment 2019-05-28 10:55:39 462 Initial revision (published)