Graph Algorithms · Medium problem

A network has routers $s,t,a,b,c,d,e,f$ with links $sa, sb, ac, bc, bd, ce, de, et, ad, af$. How many routers OTHER than $s$ and $t$ could lie on SOME shortest path from $s$ to $t$?