Mathematical analysis of routing, based on circular graphs

Routing is a problem domain with an infinite number of end-solutions. One possible approach is to solve such problems using of graph theory. This paper presents a mathematical analysis for a routing problem, based on circular graphs, where the focus is on searching for the shortest path on a circular graph. The theoretical section will be argued by an example where we look for the fastest path and possible walks within specified circular graph.