Added Graph.h
Added Graph represented by adjacency list

-Main Graph class stores Vertex objects
-Vertex objects has an ID and a vector if Vertex IDs it's connected to
Added Edge
Fixed BFS and added DFS
Fixed Dijkstra

-Dijkstras algorithm is now working properly
-Need to implement it using Fibonacci heap
Shortened path finding algorithms
Added hash table
Basic HashTable implementation

-Added functions for inserting, hashing and printing
-Has function generates a value between 0 and maxHash
	-Sums the integral value of all charcters and does % maxHash
-maxHash set in ctor initalizer list
-Size of hash table set to maxHash in ctor initializer list
-Insert uses hash function to get an index forinsertion
-Print prints all non-empty positions of hash table
-Does not currently deal with collisions
	-Previous item will be overwritten by new item
Changed HashTable to use pointers

-Changed vector to store pointers
-Changed function to use pointers ( including new in insert )
-Implented priting of chained values when two variables has the same
hash ( and thus the same index )
Added Sorting2

-Constructor adds random items to data member
-Implemented InsertionSort
Added ShellSort
Made helper functions private
Added MergeSort helper

-Added function that merges two lists
-Assumes the two lists are already sorted
-Loops through list, starting at pos 0 and keeps adding the lowest of
the two to a new list.
-If one of the lists are empty, only the items from the other list will
be added.
Added split list in half
Merge sort( not done )