###Project 1: Battle of the Dynamic Sets SkipList implementation found here .
###Project 2: Graph ADT and Algorithms ####Storing data

• Adjacency Matrix: Only when add/remove edges and check for their existence
• Adjacency List: Only adding edges or enumerating the neighbors of vertices
• Adjacency Tree: Need to find/delete edges as well as create them
• Adjacency List/Tree: Only need to enumerate edges and not find/add/delete (but in practice list is better)

Based on the Newman Readings