algorithms – A question about euclidean graph

The page you linked has the following definition:

A Euclidean graph is a graph in which the vertices represent points in the plane, and the edges are assigned lengths equal to the Euclidean distance between those points

Since the distance between any pair of points in the plane is always finite, it follows that no euclidean graph can have infinite edge weights.