algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 01:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Misc fixes across multiple algorithms (#6912)

Browse Source 
Source: Snyk code quality
Add scikit-fuzzy to requirements

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com>
This commit is contained in:
CenTdemeern1
2022-10-15 22:25:38 -07:00
committed by GitHub
parent c94e215c8d
commit 04698538d8
19 changed files with 40 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graphs/dijkstra_algorithm.py
View File

@ -89,13 +89,13 @@ class Graph:
# Edge going from node u to v and v to u with weight w
# u (w)-> v, v (w) -> u
# Check if u already in graph
if u in self.adjList.keys():
if u in self.adjList:
self.adjList[u].append((v, w))
else:
self.adjList[u] = [(v, w)]
# Assuming undirected graph
if v in self.adjList.keys():
if v in self.adjList:
self.adjList[v].append((u, w))
else:
self.adjList[v] = [(u, w)]