This study analyzes the numerical convergence and processing time required by several classical and new solution methods proposed in the literature to solve the power-flow problem (PF) in direct-current (DC) networks considering radial and mesh topologies. Three classical numerical methods were studied: Gauss–Jacobi, Gauss–Seidel, and Newton–Raphson. In addition, two unconventional methods were selected. They are iterative and allow solving the DC PF in radial and mesh configurations. The first method uses a Taylor series expansion and a set of decoupling equations to linearize around the desired operating point. The second method manipulates the set of non-linear equations of the DC PF to transform it into a conventional fixed-point form. Moreover, this method is used to develop a successive approximation methodology. For the particular case of radial topology, three methods based on triangular matrix formulation, graph theory, and scanning algorithms were analyzed. The main objective of this study was to identify the methods with the best performance in terms of quality of solution (i.e., numerical convergence) and processing time to solve the DC power flow in mesh and radial distribution networks. We aimed at offering to the reader a set of PF methodologies to analyze electrical DC grids. The PF performance of the analyzed solution methods was evaluated through six test feeders; all of them were employed in prior studies for the same application. The simulation results show the adequate performance of the power-flow methods reviewed in this study, and they permit the selection of the best solution method for radial and mesh structures.