This paper presents an algorithm for solving the AC basic power flow based on some enrichments provided in the bus admittance matrix methods findable in the literature. In particular, the interpretation of the slack bus generator as a current source rather than a voltage one and its inclusion inside an “all-inclusive” admittance matrix allows obtaining strong performances of the algorithm. In fact, this method gives both a well conditioning of the admittance matrix and the reduction of matrix partitioning for each iteration. As a result, a greater precision of the solution, a shorter execution time compared to classical commercial methods, a decreasing number of iterations and optimal convergence properties are obtained. Eventually, in order to show the efficiency of the method, real and fictious networks are tested, by comparing its results and performances with robust open source/commercial software packages that use well-known methods ( <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.</i> , Newton-Raphson and Fast Decoupled Load Flow methods).