# Over Order Graph

## `GraphOverOrders(R): AlgEtQOrd -> GrphDir`

Given an order $R$ returns the graph $G$ of minimal inclusions of the overorders of $R$. More precisely, the vertices of $G$ are integers between 1 and the number of `OverOrders(R)`, and there is an edge $[i,j]$ if and only if `OverOrder(R)[j]` is a minimal overorder of `OverOrders(R)[i]`.