pythonpeixun
diff --git a/‎graphs/dijkstra.py
Lines changed: 2 additions & 2 deletions b/‎graphs/dijkstra.py
Lines changed: 2 additions & 2 deletions
diff --git a/‎graphs/directed_graph_list.py
Lines changed: 5 additions & 5 deletions b/‎graphs/directed_graph_list.py
Lines changed: 5 additions & 5 deletions
@@ -15,7 +15,7 @@ def add_edge(self, source, dest, weight):
         self.adjacency_list[source].append(Edge(dest, weight))
         self.adjacency_list[dest].append(Edge(source, weight))
 
-    def get_edge(self, vertex):
+    def get_neighbor(self, vertex):
         for e in self.adjacency_list[vertex]:
             yield e
 
@@ -43,7 +43,7 @@ def dijkstra(graph, source, dest):
         v_tuple = q.get()
         v = v_tuple[1]
 
-        for e in graph.get_edge(v):
+        for e in graph.get_neighbor(v):
             candidate_distance = distances[v] + e.weight
             if distances[e.vertex] > candidate_distance:
                 distances[e.vertex] = candidate_distance
 
@@ -28,7 +28,7 @@ def get_vertex(self):
         for v in self.adjacency_list:
             yield v
 
-    def get_edge(self, vertex):
+    def get_neighbor(self, vertex):
         """
         Generator for returning the next vertex adjacent to the given vertex
         :param vertex:
@@ -60,7 +60,7 @@ def dfs(self):
             while to_visit:
                 v = to_visit.pop()
 
-                for neighbor in self.get_edge(v):
+                for neighbor in self.get_neighbor(v):
                     if neighbor not in parents:
                         parents[neighbor] = v
                         to_visit.append(neighbor)
@@ -82,7 +82,7 @@ def bfs(self):
             while not to_visit.empty():
                 v = to_visit.get()
 
-                for neighbor in self.get_edge(v):
+                for neighbor in self.get_neighbor(v):
                     if neighbor not in parents:
                         parents[neighbor] = v
                         to_visit.put(neighbor)
@@ -113,7 +113,7 @@ def contains_cycle(self):
                     statuses[v] = STATUS_STARTED
                     to_visit.append(v)  # add to stack again to signal vertex has finished DFS
 
-                for u in self.get_edge(v):
+                for u in self.get_neighbor(v):
                     if u in statuses:
                         if statuses[u] == STATUS_STARTED:
                             contains_cycle = True
@@ -152,7 +152,7 @@ def topological_sort(self):
                     statuses[v] = STATUS_STARTED
                     to_visit.append(v)  # add to stack again to signal vertex has finished DFS
 
-                for u in self.get_edge(v):
+                for u in self.get_neighbor(v):
                     if u not in statuses:
                         to_visit.append(u)