<p>Water flow routing algorithms are a cornerstone of landscape evolution models (LEMs), enabling efficient simulations of complex water flow networks across varying spatial and temporal scales. Among these, multiple flow direction (MFD) and single flow direction (SFD) algorithms are widely used to compute local drainage areas, yet they suffer from mesh dependency issues that compromise their consistency. This long-standing problem has motivated various empirical corrections. Despite these efforts, the lack of a robust mathematical framework has hindered a complete resolution of these deficiencies. Building on recent findings based on general Gauckler-Manning-Strickler (GMS) water mass conservation models, this paper unifies existing MFD/SFD methodologies, including node-to-node variants. We demonstrate that all such algorithms can be corrected through a simple post-processing step, effectively eliminating anomalous grid dependency while preserving the diversity of approaches in the literature. The proposed framework bridges the gap between traditional MFD algorithms and more modern definition of the specific catchment area. It also enables a classification of classical MFD/SFD algorithms based on their flow-sharing formulas. Numerical examples illustrate the versatility and effectiveness of this correction.</p>