OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix typo: Adjancent -> Adjacent (#2184)

Browse Source
This commit is contained in:
Marcos Cannabrava 2020-07-07 00:00:07 -03:00 committed by GitHub
parent 367f8ceddd
commit 728c0df355
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
graphs/breadth_first_search_shortest_path.py
View File

@ -16,7 +16,7 @@ graph = {
class Graph: class Graph:
def __init__(self, graph: Dict[str, str], source_vertex: str) -> None: def __init__(self, graph: Dict[str, str], source_vertex: str) -> None:
"""Graph is implemented as dictionary of adjancency lists. Also, """Graph is implemented as dictionary of adjacency lists. Also,
Source vertex have to be defined upon initialization. Source vertex have to be defined upon initialization.
""" """
self.graph = graph self.graph = graph
@ -37,11 +37,11 @@ class Graph:
while queue: while queue:
vertex = queue.pop(0) vertex = queue.pop(0)
for adjancent_vertex in self.graph[vertex]: for adjacent_vertex in self.graph[vertex]:
if adjancent_vertex not in visited: if adjacent_vertex not in visited:
visited.add(adjancent_vertex) visited.add(adjacent_vertex)
self.parent[adjancent_vertex] = vertex self.parent[adjacent_vertex] = vertex
queue.append(adjancent_vertex) queue.append(adjacent_vertex)
def shortest_path(self, target_vertex: str) -> str: def shortest_path(self, target_vertex: str) -> str:
"""This shortest path function returns a string, describing the result: """This shortest path function returns a string, describing the result: