The article investigates stability analysis in the shortest path problem. We consider a directed graph in which all optimal paths from a source to a sink pass through a certain vertex. For such vertices, we introduce a definition of a vertex stability radius and research its features. A comparison with other results devoted to stability analysis is provided. Several explanatory and practical examples are presented.