Просмотр кода страницы Geodesically convex set of vertices

'''Geodesically convex set of vertices''' --- геодезически выпуклое
множество вершин. 

Given a graph <math>G = (V,E)</math>, a subset <math>S \subseteq V</math> is '''geodesically convex''' if for any two vertices <math>u,v \in S</math> all vertices
on the ''shortest paths'' between <math>u</math> and <math>v</math> are also contained in <math>S</math>.