Djikstra Start (Setting up the basic Graph class)

[justinklee345]

I created an adj_matrix that is essentially a 2D vector of ints. The first index is the NodeID of the "from" vertex and the second index is the NodeID of the "to" vertex. Each value in the adj_matrix can be either a 0 or a 1. 1 signifies that there is a connection between the two vertices and 0 signifies that there isn't. adj_matrix[0][1] = 1 would mean that Node 0 follows Node 1. I also created an addEdge function which adds an edge on the adj_matrix. Finally, populateMatrix is a function that would be called in the constructor that uses the addEdge function to populate the adj_matrix. I will get started on working on the algorithms in the next week as per our project schedule.

[minq02]

I have looked at the code. No conflicts between main branch.