Proof For Minimal Number of Edges Added to Make a Directed Graph Strongly Connected

Правка en1, от vamaddur, 2017-08-02 14:51:23

Link

Can someone prove the correctness of the approach described in the first answer on the thread? I understand why the first step is crucial as a starting point.

Thanks in advance!

Теги sccs, directed-graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский vamaddur 2017-08-02 14:51:23 364 Initial revision (published)