AbstractWe consider two options for a particle's entire journey through a certain directed graph. Both options involve a random assignment to the journey route to be followed. We are interested in the option that offers, on average, the shortest route. Therefore, we determine the average journey length for each of the two options. As part of our analysis, we prove some combinatorial identities that appear to be new. Some suggestions for further work are given.