# What is a way to do this combinatorics problem that could generalize to do any of problems similar to this but with more path?

A bug travels from $A$ to $B$ along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?