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)**

- there should be a path from v1 to v2
*through some directed edges*

eg v1–>v2, v1–>v3–>v4–>v2 - 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

KINDLY ADDRESS,

I JUST WANT THAT EVERYONE’S ABLE TO UNDERSTAND WHAT I AM STUCKING AT,

I.E. WHERE AM I GOING WRONG