Yahoo Answers is shutting down on May 4th, 2021 (Eastern Time) and beginning April 20th, 2021 (Eastern Time) the Yahoo Answers website will be in read-only mode. There will be no changes to other Yahoo properties or services, or your Yahoo account. You can find more information about the Yahoo Answers shutdown and how to download your data on this help page.
Trending News
Help needed with graphs in discrete math?
(a) Prove that every node and edge of a graph are contained in exactly one weak component
(b) Show that a digraph G is strongly connected if all the entries of the distance matrix except the diagonal entries are nonzero.
1 Answer
- ?Lv 69 years agoFavorite Answer
sorry but i can help a bit of you:
(b) A Directed Graph is said to be strongly connected if using one node all other nodes can be traversed.
Since diagonal entries are zeros and other are non-zeros then other can be reachable via each other.