[~, idx] = min(G.Edges.Weight);
shortest_path = G.Edges.EndNodes(idx,:);
Because you do not have a static node for source and destination, we are free to say that the shortest path is the single edge of minimum weight -- you have not, for example, said that the shortest path must be (say) length 3.
Best Answer