Merge pull request careercup#18 from papay0/master

Fix name function

Author: mmermerkaya

Chapter4/41RouteBetweenNodes.py

@@ -41,7 +41,7 @@ def getVertex(self):
         return self.vertex
 
 
-def depthfirstsearch(g, start, end):
+def breadthfirstsearch(g, start, end):
     if start == end:
         return True
     q = Queue.Queue(len(g.getNodes()))
@@ -112,4 +112,4 @@ def createNewGraphWithLoop():
 start = n[0]
 end = n[5]
 print "Start at:", start.getVertex(), "End at: ", end.getVertex()
-print depthfirstsearch(g, start, end)
+print breadthfirstsearch(g, start, end)