The rotorrouter model is a popular deterministic analogue of random
walk. In this paper we prove that all orbits of the rotorrouter operation
have the same size on a strongly connected directed graph (digraph) and
give a formula for the size. By using this formula we address the following
open quest[r]