def rank(self):
max_rank = <NUM_LIT:0><EOL>for each in self.hyperedges():<EOL><INDENT>if len(self.edge_links[each]) > max_rank:<EOL><INDENT>max_rank = len(self.edge_links[each])<EOL><DEDENT><DEDENT>return max_rank<EOL>
Return the rank of the given hypergraph.

@rtype:  int
@return: Rank of graph.