This Python program counts the number of strongly connected components in a directed graph. The first line of input has two space delimited integers, the number of vertices n and the number of edges m ...

# elements to the right of nums[i]. # To the right of 5 there are 2 smaller elements (2 and 1). # To the right of 2 there is only 1 smaller element (1). # To the right of 6 there is 1 smaller element ...