Graph Algorithms · Hard problem

A network has routers $a,b,c,d,e,f,g,h$ and links $ab, ac, bd, cd, ce, df, ef, dg, fh, gh$. Each link is one hop. How many DIFFERENT routes of the fewest possible hops are there from $a$ to $h$?