We propose a new class of path-based solution algorithms to solve the Restricted Stochastic User Equilibrium (RSUE), as introduced in Watling et al (2014). The class allows a flexible specification of how the choice sets are 'systematically' grown by considering congestion effects and how the flows are allocated among routes. The specification allows adapting traditional pathbased stochastic user equilibrium flow allocation methods (designed for pre-specified choice sets) to the generic solution algorithm. We also propose a cost transformation function and show that by using this we can, for certain Logit-type choice models, modify existing path-based Deterministic User Equilibrium solution methods to fit the RSUE solution algorithm. The transformation function also leads to a two-part relative gap measure for consistently monitoring convergence to a RSUE solution. Numerical tests are reported on two real-life cases, in which we explore convergence patterns and choice set composition and size, for alternative specifications of the RSUE solution algorithm.