A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

(A) weakly connected
(B) strongly connected
(C) tightly connected
(D) linearly connected

💬 Discuss

✅ Correct Answer: (B) strongly connected

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

861

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate