A directed graph is semi-connected if for all pairs of vertices i,j there is either a path from i to j or a path from j to i.
Page:
Context:
Rosalind is a platform for learning bioinformatics through problem solving. Please login with Google/Twitter/Facebook or register a new account.
