Compute the number of paths from S (start) to G (goal) in the following image, without using any road twice (but may visit an intersection twice). As an explicit example, the path in pink is one valid path.
Clarifications:
by
Ivan Koswara
