It appears that your browser has JavaScript disabled. Rosalind requires your browser to be JavaScript enabled.

Strongly Connected Components solved by 411

Feb. 21, 2014, 5:41 p.m. by Rosalind Team

Topics: Graphs

Problem

Given: A simple directed graph with $n \le 10^3$ vertices in the edge list format.

Return: The number of strongly connected components in the graph.

Sample Dataset

Sample Output

Please login to solve this problem.

Welcome to Rosalind!

Rosalind is a platform for learning bioinformatics through problem solving.
Please login with Google/Twitter/Facebook or register a new account.