Path Counting
Computer Science
Level
3
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:
- A road is a segment between two intersections that doesn't include any other intersection. A path is a connected sequence of roads from start to goal.
by
Ivan Koswara