//
// tree_prop.pp
// 
// Check if the class dictionary with this S-naught set satisfies the
// tree property.  This is done by visiting each Vertex in S-naught and
// setting the requisite contained-in sets.  If all the contained in 
// sets can be set without an inconsistency then the class dictionary
// must satisfy the tree property.
// 

*operation* int tree_prop(Ar_Vertex_list* arv_list)
  *init* (@ 1 @)
  *traverse* *from* Vertex_comma_list *to* Vertex
  *wrapper* Vertex
    *prefix* (@ 
      Ar_Vertex_list *c = arv_list->compute_c(this);

      if (!(c->set_contained_ins())) {
        return_val = 0;
      }
    @)