plais/computational-geometry-visu
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

FIx comments

Browse Source
This commit is contained in:
Pascal Lais
2020-03-09 19:18:07 +01:00
parent 978bb9b789
commit 70bb80e445
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
algorithm.py
View File

@@ -15,8 +15,8 @@ class Algorithm():
def __init__(self): def __init__(self):
self._input = None # The input values self._input = None # The input values
self._result = {} # The result of the sweep self._result = {} # The result of the sweep
self._ready = False # If the sweep is reade to be executed self._ready = False # If the algorithm is ready to be executed
self._running = False # If the sweep is currently running self._running = False # If the algorithm is currently running
self._section = "start" # A string that names the current section of the algorithm self._section = "start" # A string that names the current section of the algorithm
self._num_steps = {} # The number of steps that were needed to solve the problem self._num_steps = {} # The number of steps that were needed to solve the problem
@@ -66,8 +66,8 @@ class NearestNeighborsSweep(Algorithm):
self._ready = True self._ready = True
elif point_set is not None: elif point_set is not None:
raise Exception(self, "Wrong input type for point_set") raise Exception(self, "Wrong input type for point_set")
self._sss = {} self._sss = {} # The sweep state structure
self._es = [] self._es = [] # The event queue
self._result = {"success": False, \ self._result = {"success": False, \
"distance": None, \ "distance": None, \
"points": [None, None]} "points": [None, None]}