Motivation¶
Working on the programming problems from Rosalind I decided to present some of the algorithms I used to solve some of them.
I will try to present the algorithm/code as a way to solve a general problem and not the actual problem because I don't want to spoil the fun for others.
Graphs¶
In [1]:
# For all the following graph algorithms I will use the dictionary with integers as keys and sets as values.
graph = {
0:set([1]),
1:set([2]),
2:set([])
}
#This Graph is just:
# 0 -> 1 -> 2
I will also try to use Networkx to give a visual representation.
Comments? let me know on @sergiobuj