How many continuous paths from A to B, along segments of the figure, do not revisit any of the six labeled points?
6. from A there are only two paths you can take (A -> C and A -> D) from either C or D there are three paths each and each subsequent choice leads to a node for which there are only possible path remaining. (i.e. A to C to F which means that from F you can only move to D then to E then to B; one path remaining at each of the remaining 3 nodes)