diff options
| author | Gustav Sörnäs <gusso230@student.liu.se> | 2020-11-05 16:42:57 +0100 |
|---|---|---|
| committer | Gustav Sörnäs <gusso230@student.liu.se> | 2020-11-05 16:42:57 +0100 |
| commit | 3a7c90f683c1c29790c2033de02c501f76735aa9 (patch) | |
| tree | 4b2f63c8476f8948e747f27f9313270fb11953aa /algorithms.py | |
| parent | 5bd68cac4b2aa953bcc63e8e903ed8c5f2aec5c2 (diff) | |
| download | tdde25-3a7c90f683c1c29790c2033de02c501f76735aa9.tar.gz | |
is
Diffstat (limited to 'algorithms.py')
| -rw-r--r-- | algorithms.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/algorithms.py b/algorithms.py index cc8d35f..7140a17 100644 --- a/algorithms.py +++ b/algorithms.py @@ -23,7 +23,7 @@ def get_closest_node_id(nodes, source_node): for node_id, node in nodes.items(): length = length_haversine(source_node, node) - if min_node == None or length < min_value: + if min_node is None or length < min_value: min_node = node_id min_value = length |