Abstract
This paper presents a new algorithm determining the K-th best path without any circuit between two specified vertices in a connected, simple and nonoriented graph. The method presented here is based on the well-known fact that the minimum set of ring sum of several Euler graphs and a special path between two vertices consists of all paths between the vertices. Lastly, an illustrative example is given and the efficiency of the algorithm is estimated approximately.
