In this paper we consider fully iterative path following algorithms for nonlinear parameter-dependent compact fixed point problems. By fully iterative we mean that linear and nonlinear solves and testing for branching are done by iterative methods. We show that if these problems are discretized so that certain collective compactness and strong convergence properties hold, then certain fully iterative path following algorithms can follow smooth folds and capture simple bifurcations in a mesh independent way.