Graph Algorithms · Easy problem

A communication network has routers $s, a, b, c, d, e, f$ with direct links $sa, sb, ac, bc, bd, ce, de, ef$ (each link is one hop). What is the fewest number of hops a message needs to travel from $s$ to $f$?