          if current_index < points:
              return [current_index]
          left = int(tree[current_index-points, 0])
          right = int(tree[current_index-points, 1])
          return self.seriation(tree, points, left) + self.seriation(tree, points, right)
 
</s> remove             seriation computes the order implied by a hierarchical tree (dendrogram)
 </s> add         Seriation computes the order implied by a hierarchical tree (dendrogram).

        Parameters
        ----------
        tree: numpy.ndarray
           A hierarchical tree (dendrogram)
        points: int
            The number of points given to the clustering process
        current_index: int
            The position in the tree for the recursive traversal

        Returns
        -------
        list:
            The indices in the order implied by the hierarchical tree </s> remove     def seriation(self, tree, points, current_index):
        """ Seriation method for sorted similarity
            input:
                - tree is a hierarchical tree (dendrogram)
                - points is the number of points given to the clustering process
                - current_index is the position in the tree for the recursive traversal
            output:
                - order implied by the hierarchical tree
 </s> add     def _seriation(self, tree, points, current_index):
        """ Seriation method for sorted similarity. </s> remove         print(result_linkage.shape)
        exit(0)
        result_order = self.seriation(result_linkage,
                                      num_predictions,
                                      num_predictions + num_predictions - 2)

 </s> add         result_order = self._seriation(result_linkage,
                                       num_predictions,
                                       num_predictions + num_predictions - 2) </s> remove             retval = "linkage"
 </s> add             retval = False
        return self._seriation(tree, points, left) + self._seriation(tree, points, right)
          if current_index < points:
              return [current_index]
          left = int(tree[current_index-points, 0])
          right = int(tree[current_index-points, 1])
        return self._seriation(tree, points, left) + self._seriation(tree, points, right)
keep keep keep keep replace
 bugfix: tools.preview - Fix for new icons
bugfix: lib.vgg_face2_keras - Remove debug code
documentation: lib.vgg_face2_keras 
lib/vgg_face2_keras.py