Graph Algorithms · Challenge problem

A sensor network has $9$ nodes numbered $1$–$9$ with connections $12, 23, 34, 45, 26, 67, 48, 89, 79$. A signal travels one hop at a time along a connection, in either direction, always by a shortest route. What is the greatest possible number of hops between any two nodes in this network (its diameter)?