//
// compute_contained_sets.pp
//
// Creates an Ar_Vertex_list which contains all the Ar_Vertex objects whose 
// alternation reachable sets contain the Vertex v sorted by decreasing 
// cardinality of the alternation reachable sets.
//

*operation* Ar_Vertex_list* compute_c(Vertex* v)
  *init* (@ new Ar_Vertex_list @)
  *traverse* *from* Ar_Vertex_list *via* Vertex_comma_list *to* Vertex
  *carry* Ar_Vertex* arv = (@ this @)
    *along* *from* Ar_Vertex *to* Vertex
  *wrapper* Vertex
    *prefix* (@ 
      if (g_equal(v)) {
        return_val = return_val->arsize_insert(arv);
      }
    @)