Glossary

Undirected graph

An undirected graph is a graph in which an orientation on edges is not specified, in contrast to directed graphs. For this reason, the edge connecting vertices u and v may be represented as either {u,v} or {v,u}.

When the term "graph" is used without specification, we typically assume that the graph is undirected.

Welcome to Rosalind!

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