Discussion
In a directed graph, if there is a path from each vertex to every other vertex, then it is called :
Answer: C
Such a directed graph is strongly connected.
A directed graph is strongly connected when there is a directed path from every vertex to every other vertex, following the edge directions.
It is weakly connected if it becomes connected only when edge directions are ignored. 'Tightly connected' and 'loosely connected' are not standard terms for this property.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development