In this paper we revisit and revise the method of Ma and Thorp [1] for computing all the real-valued solutions to the power flow equations. In a prior work we presented a counterexample to their algorithm [2]. Here we review the general topologically-inspired approach they proposed to trace between solutions assuming one solution is known. We offer a revision to the method by transforming the equations in such a way that all traces are bounded and all traces emanating from a known solution are explored. Results show that the revised method finds all real-valued solutions for power system problems reported in the literature for which all solutions are provably known, including the counterexample in [2].