<p>Shortest path problems are a family or class of dilemmas in graph theory where the theme is to investigate or analyze the minimum distance or shortest way/route among two or more vertices in a graph. For the evaluation of the above problems, many people have used the algorithm of Dijkstra’s model, Floyd–Warshall model, and Bellman–Ford mode. The shortest path problems are also valuable collections of optimization theory problems that aim to evaluate the shortest path among any two points or nodes in a graph. This technique is utilized in various fields such as computer science, operation research, transportation problems, and network design. This manuscript proposes the technique of Yager aggregation operators for circular Pythagorean fuzzy information based on Yager norms. For this, first, we derive the model of circular Pythagorean fuzzy Yager operational laws, and then we derive the model of circular Pythagorean fuzzy Yager weighted averaging operator, circular Pythagorean fuzzy Yager ordered weighted averaging operator, circular Pythagorean fuzzy Yager hybrid weighted averaging operator, circular Pythagorean fuzzy Yager weighted geometric operator, circular Pythagorean fuzzy Yager ordered weighted geometric operator, circular Pythagorean fuzzy Yager hybrid weighted geometric operator, and described their valuable properties. Further, we design two different decision-making models, called the circular Pythagorean fuzzy multi-attributive border approximation area comparison technique and the circular Pythagorean fuzzy multi-attribute decision-making technique for the assessment of the shortest path problems among any two countries or cities. Finally, we illustrate some numerical examples for the investigation of the supremacy and rationality of the designed models with the help of comparative analysis among proposed ranking models with some prevailing ranking models.</p>