Java Say Graph G Strongly Connected Every Pair Vertices J G Path J Showhowtotest G Strongl Q43799436
In Java:
We say that a graph G is strongly-connected if, for every pairof vertices i and j in G, there is a path from i to j.Showhowtotest if G is strongly-connected in O(n + m) time.. Write a method and test it in Main. Explain why it isO(n+m).
Graph is directed
Expert Answer
Answer to In Java: We say that a graph G is strongly-connected if, for every pair of vertices i and j in G, there is a path from i…
OR