How many continuous paths from A to B, along segments of the figure, do not revisit any of the six labeled points?

First, count how many paths goes from C to A without going through B. Call this number n1. Next, count how many paths goes from D to A without going through B. Call this number n2. The answer is n1 + n2.