Added a function that converts strings in cells to numbers (if it can be done) called cellstr2num.
Merge pull request #1 from chriskopher/master

Added weightedAvg.m, which calculates the weighted average of two numbers. This will be the final edge-weight of our graph.
Rename weightedAvg.m to weighted_avg.m
Removed printing of variables to clean up the output, and initialized the graph_m result to a matrix of -1's of size max(edges(node2_column)).
Created the total_price and total_time columns in the edges matrix, which may be unnecessary and could be incorporated directly into the graph creation.
Added the skeleton for setting values in graph_m.
Update graph.m (used weighted average to determine optimal edge).
Merge pull request #2 from fredrickleber/patch-1

Update graph.m (used weighted average to determine optimal edge).
Added the function declaration in a new file for the algorithm.
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.
Added skeleton code for the required methods to run the algorithm smoothly.
Filled in the scan function, which returns the column location of the smallest positive value in a 1xn vector.
Updated backtrack.m, added all the code
Merge pull request #3 from fredrickleber/patch-2

Updated backtrack.m, added all the code
Update backtrack.m

changed the hard-coded "current_node = 1" to the initial memory matrix value, as that's what we needed.
Merge pull request #2 from adanmoran/master

Re-syncing