# Graph Classification Question

I'm looking at a specific type of graph, and my google-fu has failed me. The graph $G$ is a connected unweighted directed graph where for each pair of vertices $(u,v) \in G$ the shortest path from $u$ to $v$ is unique.

What is such a graph called?

-
Geodetic? cstheory.stackexchange.com/questions/16354/… answers this question anyhow! –  Sharkos May 8 '13 at 15:38