Weakly geodetic graph

Weakly geodetic graph --- слабо геодезический граф.

[math]\displaystyle{ G }[/math] is a weakly geodetic graph if for every pair of vertices whose distance is at most 2 there is a unique path of the minimum length between them.