# Connected Graph

By term “connected graph” --> we mean that there’s a path between every two vertices (say v1 and v2 arbitrarily)

But consider the case when the graph is directed as well i.e, each edge has a direction

then is it necessary that both the below conditions satisfy for (connected & directed graph)

1. there should be a path from v1 to v2 through some directed edges
eg v1–>v2, v1–>v3–>v4–>v2
2. there should be a path from v2 to v1 as well through some directed edges
eg v2–>v3–>v1

IF SOMETHING IS NOT CLEAR REGARDING MY DOUBT
I JUST WANT THAT EVERYONE’S ABLE TO UNDERSTAND WHAT I AM STUCKING AT,
I.E. WHERE AM I GOING WRONG

U r asking, or tell us what u want to know ?

In undirected graph we talk about connected components but in directed graph we talk about strongly connected components, a set of nodes are said to be a part of a strongly connected component iff for every pair of vertices v_1 and v_2 in the set there is a directed path from v_1 to v_2 and also there is a directed path from v_2 to v_1.
Also if there is a path from v_1 to v_2 but not from v_2 to v_1 we say graph/component is weakly connected.

3 Likes

here is my doubt brother
I am stuck at this point

1 Like

Avoid writing everything in Capital Letters.

1 Like