def __init__(self):
            self.children = {}
            """ Node weight """
            self.weight = 0
            """ Parent """
            self.parent = None
            """ Suffix link """
            self.suffix_link = None
            """ Arc that points to the node; Triple of form
                (string_index, substring_start_index[inclusive], substring_end_index[exclusive]) """
            self._arc = None
            """ Used in Ukkonen's algorithm """
            self._e = []
            """ Pointer to the strings collection """
            self.strings_collection = []
            # No sense in initializing node weight here
            # it is not possible to update it quickly while
            # constructing the tree; that's made later in one single pass
Tests the path specification comparable property.
dataset/ETHPy150Open mikhaildubov/AST-text-analysis/east/asts/ast.py/AnnotatedSuffixTree.Node.__init__--crossover with--dataset/ETHPy150Open log2timeline/dfvfs/tests/path/tsk_partition_path_spec.py/TSKPartitionPathSpecTest.testComparable