Trie traversal

.travis.yml

@@ -0,0 +1,18 @@
+language: python
+python:
+  - "2.7"
+  - "3.5"
+
+
+# command to install dependencies
+install:
+  - pip install -e .[test]
+  # - pip install coveralls
+
+# command to run tests
+script: 
+  - py.test --cov=. --cover-report term-missing
+
+# notifications
+notifications:
+  email: false

README.MD

@@ -1,32 +1,12 @@
+[![Build Status](https://travis-ci.org/CCallahanIV/data-structures.svg?branch=master)](https://travis-ci.org/CCallahanIV/data-structures)
 #Summary
 
-The assignment was to implement a [Weighted Graph](https://codefellows.github.io/sea-python-401d5/assignments/graph_3_weighted.html)
-in Python containing the following methods:
 
-
-    * g.nodes(): return a list of all nodes in the graph
-    * g.edges(): return a list of all edges in the graph
-    * g.add_node(n): adds a new node 'n' to the graph
-    * g.add_edge(n1, n2): adds a new edge to the graph connecting 'n1' and 'n2', if either n1 or n2 are not already present in the graph, they should be added.
-    * g.del_node(n): deletes the node 'n' from the graph, raises an error if no such node exists
-    * g.del_edge(n1, n2): deletes the edge connecting 'n1' and 'n2' from the graph, raises an error if no such edge exists
-    * g.has_node(n): True if node 'n' is contained in the graph, False if not.
-    * g.neighbors(n): returns the list of all nodes connected to 'n' by edges, raises an error if n is not in g
-    * g.adjacent(n1, n2): returns True if there is an edge connecting n1 and n2, False if not, raises an error if either of the supplied nodes are not in g
-    * g.depth_first_traversal(start): Returns the path list for the entire graph with a depth first traversal.
-    * g.breadth_first_travers(start): Returns the path list for the entire graph with a breadth first traversal.
-
-
-# Coverage:
-
----------- coverage: platform darwin, python 3.5.2-final-0 -----------
-
-
-| Name                     | Stmts | Miss | Cover |
-| -----------------------  | ----- | ---- | ----- |
-| weighted_graph.py        |  78   |  3   | 96%   |
-| test_weighted_graph.py   |  178  |  0   | 100%  |
-| -----------------------  |  ---  |  --  | ----  |
-| TOTAL                    |  256  |  3   | 98%   |
+        insert(self, string): will insert the input string into the trie. If character in the input string is already present, it will be ignored.
+        contains(self, string): will return True if the string is in the trie, False if not.
+        size(self): will return the total number of words contained within the trie. 0 if empty.
+        remove(self, string): will remove the given string from the trie. If the word does not exist, will raise an appropriate exception.
+        traversal(self, start=None): a generator yielding values in the tree in depth-first order.
+