Count routes by branches

Logical thinking · Suggested grades 4

Count routes by branches

Download video
Open Chinese transcript
  1. 路线图从起点分到A和B,两类分支不交叉。经A与经B不能是同一条路线。
  2. 到A只有1种走法,从A到终点有2条,所以经A共有1乘2等于2条。
  3. 到B也只有1种,从B到终点有3条,所以经B共有3条。
  4. 两类路线互不重叠,可以相加:2加3等于5。
  5. 逐条列出A1、A2、B1、B2、B3,正好五条,没有遗漏。
  6. 因此总路线数是5。分支计数时先算每一类,再确认互斥后相加。只有确认两类路线互斥,才可以直接相加。
Sources for this explanation

Logical thinking

Count each disjoint branch and add the branch totals.

Worked example

There is one route from start to A and one to B; A has 2 routes to finish and B has 3, with disjoint branches. Total routes?

The disjoint A branch has 2 routes and B has 3, so 2+3=5.

Try one question

There are 2 disjoint routes via A and 2 via B. Total?