Kosaraju Algorithm

hard

Graphs

Question Solve Solutions

You are given a graph with N nodes and M directed edges. Find the number of Strongly connected components in the graph.

Input Format

First line contains two space separated integers,N and M. Then M lines follow, each line has 2 space separated integers ai and bi.

Output Format

Print in one line the number of strongly connected components in the graph.

Constraints

1&lt;= N &lt;= 10000
1&lt;= M &lt;= (N*(N-1))/2
1&lt;= ai, bi &lt;= N

Example

Input

Output

Pepcoding Course Schedule

Related Questions

easy Sentence Similarity easy Redundant Connection easy Alien Dictionary medium Bellman Ford hard Negative Weight Cycle Detection medium Pepcoder And Reversing medium Pepcoding Course Schedule hard Mother Vertex medium Minimum Cost To Connect All Cities medium Number Of Enclaves medium Zero One Matrix medium Number Of Distinct Island easy Rotting Oranges medium As Far From Land As Possible easy Shortest Bridge hard Articulation Point