class_docstr: This is a weighted Forest structure, i.e. a tree
  - each node has one parent and children
  (hierarchical structure)
  - some of the nodes can be viewed as leaves, other as roots
  - the edges within a tree are associated with a weight:
  +1 from child to parent
  -1 from parent to child
  - additionally, the nodes have a value, which is called 'height',
  especially useful from dendrograms
  
  members
  -------
  V : (int, >0) the number of vertices
  E : (int) the number of edges
  parents: array of shape (self.V) the parent array
  edges: array of shape (self.E,2) reprensenting pairwise neighbors
  weights, array of shape (self.E), +1/-1 for scending/descending links
  children: list of arrays that represents the childs of any node
  height: array of shape(self.V)
class_docstr_tok: ["This","is","a","weighted","Forest","structure",",","i.e",".","a","tree","-","each","node","has","one","parent","and","children","(","hierarchical","structure",")","-","some","of","the","nodes","can","be","viewed","as","leaves",",","other","as","roots","-","the","edges","within","a","tree","are","associated","with","a","weight",":","+1","from","child","to","parent","-1","from","parent","to","child","-","additionally",",","the","nodes","have","a","value",",","which","is","called","'height","'",",","especially","useful","from","dendrograms","members","--","--","--","-","V",":","(","int",",",">","0",")","the","number","of","vertices","E",":","(","int",")","the","number","of","edges","parents",":","array","of","shape","(","self.V",")","the","parent","array","edges",":","array","of","shape","(","self.E,2",")","reprensenting","pairwise","neighbors","weights",",","array","of","shape","(","self.E",")",",","+1\/-1","for","scending\/descending","links","children",":","list","of","arrays","that","represents","the","childs","of","any","node","height",":","array","of","shape","(","self.V",")"]
docstr: Check that height[parents[i]]>=height[i] for all nodes
          
docstr_tok: ["Check","that","height","[","parents","[","i","]","]",">","=height","[","i","]","for","all","nodes"]
code: def check_compatible_height(self):
      """Check that height[parents[i]]>=height[i] for all nodes"""
      OK = True
      for i in range(self.V):
          if self.height[self.parents[i]] < self.height[i]:
              OK = False
      return OK
  
imports: from warnings import warn
  import numpy
  from ..graph.forest import Forest
  from ..graph.graph import WeightedGraph
label_desc: Use image node_id 4 for calling the WeightedForest obj's underlying member method code with example usage: obj.check_compatible_height() and returns: OK