COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Tightly Connected
|
|
|
Strongly Connected
|
|
|
Weakly Connected
|
|
|
Loosely Connected
|
Detailed explanation-1: -A strongly connected graph is a directed graph in which every ordered pair of vertices in the graph is strongly connected. Otherwise, it is called a weakly connected graph if every ordered pair of vertices in the graph is weakly connected. Otherwise it is called a disconnected graph.
Detailed explanation-2: -In the graph, a vertex should have edges with all other vertices, then it called a complete graph. In other words, if a vertex is connected to all other vertices in a graph, then it is called a complete graph.
Detailed explanation-3: -Loosely Connected Was this answer helpful?
Detailed explanation-4: -7. Connected Graph. A connected graph is a graph in which we can visit from any one vertex to any other vertex. In a connected graph, at least one edge or path exists between every pair of vertices.
Detailed explanation-5: -Strongly Connected. A directed graph is strongly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph. Weakly Connected. A directed graph is weakly connected if there is a path between every two vertices in the underlying undirected graph.