Question

Define strongly connected digraph.​

Answer 1

A directed graph is called strongly connected if there is a path in each direction between each pair of vertices of the graph. In a directed graph G that may not itself be strongly connected, a pair of vertices u and v are said to be strongly connected to each other if there is a path in each direction between them.

please mark as Brainliest answer❤

Answer 2

Answer:

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they point. The nodes in a strongly connected digraph

Step-by-step explanation:

hope it's helpful ,

if it is then plz mark as brainlist