For every pair of vertices $u,v$ in an oriented graph, a $u$-$v$ $geodesic$ is a shortest directed path from $u$ to $v$.

• 本篇论文的主要内容，在于考虑若干个与图形有关的捷径问题。