added a simple dictionary of edge weights that allows for bidirectional weights
added simple tests for edge weights
changed name of file
changed name of file
Update assert values in test_proper_parenthetics.py to match the assignment specification
Update test_queue.py to look for the queue.list.head_node instead of just queue.head_node since queue is a container for a linked list.
Update Graph() to WeightedGraph() in weighted_graph.py and test_weighted_graph.py to differentiate it from a simple graph
Update README.md to include info on WeightedGraph()
Merge branch 'weighted-graph'
Add test_shortest_path_simple() to test_shortest_path.py to test finding the shortest path with dijkstra on a very simple graph
Add shortest_path.py with first working version of dijkstra()
Revise dijkstra() to update the dictionary of previous nodes only when the distance to the next node is less than the current total distance to that node
Add test_shortest_path_triangle_two_edge_path() to assert dijkstra() determines the shortest path even if it takes multiple edges
Add weighted_graph.py for Travis testing
added a first attempt at the moore search algorithm
made some minor improvements to the function, including making it a function
wrote two tests and made sure that our code worked
Add empty bst.py
Add empty test_bst.py
Add Bst() skeleton to bst.py and test skeletons to test_bst.py