The reverse of a directed graph G=(V,E) is another directed graph GR=(V,ER) on the same vertex set, but with all edges reversed; that is, ER={(v,u):(u,v)∈E}.
Source: Algorithms by Dasgupta, Papadimitriou, Vazirani. McGraw-Hill. 2006.
Page:
Context:
Rosalind is a platform for learning bioinformatics through problem solving. Please login with Google/Twitter/Facebook or register a new account.
