Before revision:  Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, but it can be shown that polynomial time is elapsed between displaying any two consecutive realizations.
After revision:  Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, but we URLanize the computation in such a way that polynomial time is elapsed between displaying any two consecutive realizations.