Strongly connected component

Question

How to find Strongly connected components and weakly connected components in the given graph?

Comments

yes strongly connected componenet should be 2

---

Following Kosaraju's algorithm, the number of strongly connected components are 2. They are ABC and D.

---

if the above graph is undirected than how many strongly connected component can have?

Answer 1

Let give by example if we go on path A to B then there must exist a path from B to A which is B C A so it is strongly connected but if it's weakly connected than such path not exist

So as a result if circular cycle/loop is there than it is strongly connected else it's weakly connected

Here A C D will be weakly connected

Comments

How $A ,C, D$ are weakly connected??

can you explain more clearly,please?