I = stringToEdgeIdeal(S, R)
This method converts a Sparse6 or Graph6 string $S$ to an edge ideal $I$ in the given polynomial ring $R$. That is, for each edge $(a,b)$ in the graph given by $S$, the monomial $a*b$ is added as a generator to $I$.
Note, this method requires that the number of variables of $R$ be the same as the number of vertices of $S$.


This method is almost always faster than converting the string to a graph and then to an edge ideal using the edgeIdeal method.
The object stringToEdgeIdeal is a method function.