mirror of
https://github.com/Doctorado-ML/STree.git
synced 2025-08-17 00:16:07 +00:00
Implement split data with or without using predictions & some tests
This commit is contained in:
@@ -17,7 +17,7 @@ class Snode:
|
||||
self._y = y
|
||||
self._down = None
|
||||
self._up = None
|
||||
self._class = None
|
||||
self._class = None # really needed?
|
||||
|
||||
def set_down(self, son):
|
||||
self._down = son
|
||||
@@ -28,13 +28,13 @@ class Snode:
|
||||
def is_leaf(self,) -> bool:
|
||||
return self._up is None and self._down is None
|
||||
|
||||
def get_down(self):
|
||||
def get_down(self) -> 'Snode':
|
||||
return self._down
|
||||
|
||||
def get_up(self):
|
||||
def get_up(self) -> 'Snode':
|
||||
return self._up
|
||||
|
||||
def __str__(self):
|
||||
def __str__(self) -> str:
|
||||
if self.is_leaf():
|
||||
num = 0
|
||||
for i in np.unique(self._y):
|
||||
|
Reference in New Issue
Block a user