Initialized the variables and added a loop to start searching the graph. Need to fill in what is done when the end node is not connected to the current node. This includes creating a backtracking method, creating a method to clean the memory matrix, creating a method to scan for the lowest cost in a vector, and the rest of the flowchart we've written down.