Train stations/Shortest connection/Exercise

Let ${}M$ be the set of all train stations in Germany. For ${}a,b\in M$, define

$d(a,b)$

to be the shortest (in terms of scheduled time) connection from ${}a$ to ${}b$. Is this a metric?

Create a solution