Find min number of edges to make undirected to make a connected directed graph strongly connected

Правка en1, от aatif20, 2020-09-27 10:56:55

Given a connect Directed Graph, find the minimum number of edge required to make every vertex reachable from each other, the condition given that you can only add edge u to v if there is an edge from v to u already exist.

Теги #graph theory, strongly connected, directed graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский aatif20 2020-09-27 10:56:55 329 Initial revision (published)