/Engine/Source/Runtime/GeometryCore/Public/Parameterization/MeshLocalParam.h
Given new Distance/UV at Parent, check if any of its neighbours are in the queue, and if they are, and the new graph distance is shorter, update their queue position (this is basically the update step of Disjktras algorithm)
void UpdateNeighboursSparse ( [FGraphNode](API\Runtime\GeometryCore\Parameterization\TMeshLocalParam\FGraphNode) * Parent )