A graphical representation of the simulation algorithms introduced in the review. Starting from a common root node representing a generic stochastic simulation algorithm, the methodologies differentiate in terms of accuracy and runtime according to exact and approximate methods. We depict with rectangles the algorithm classes and with circles the specific methods. Hybrid methods are here represented as a part of the approximate methods, however, they are often referred as a class of simulation algorithms itself. In the diagram, the τ‐leaping and the chemical Langevin methods are connected since, following the Gillespie's approach, the latter can be derived as an approximation of the former. Analogously, the deterministic methods are connected with the chemical Langevin method. Deterministic methods are indicated with dashed lines since they are not described in detail in this review.