Skip to Main Content
There have been numerous attempts to use graph-theoretic algorithms in power systems. But it has not been clear enough what the potentials and the limitations of these applications are. The goal of our work is to model differences between transportation and electrical networks and to provide a uniform way for transforming an electrical network into its transportation equivalent. The limitations of the application of graph algorithms are discussed based on this transformation. After obtaining a transportation equivalent of an electrical network, two famous graph algorithms: Max-Flow and Min-Cost Flow are executed in a tree representation.