## ← 05-14 Number Of Paths Generalizing

• 1 Follower
• 7 Lines

### Get Embed Code x Embed video Use the following code to embed this video. See our usage guide for more details on embedding. Paste this in your document somewhere (closest to the closing body tag is preferable): ```<script type="text/javascript" src='https://amara.org/embedder-iframe'></script> ``` Paste this inside your HTML body, where you want to include the widget: ```<div class="amara-embed" data-url="http://www.youtube.com/watch?v=KQp6HUU5hbQ" data-team="udacity"></div> ``` 1 Language

Showing Revision 1 created 10/03/2012 by Amara Bot.

1. Now, let's try to find a general rule for the number of ways that you can get from A to B.
2. The number of vertices in each of the graphs that I have drawn is 4, 6, 8 and 10.
3. When we have four vertices, there are two different ways to get from A to B.
4. When we have six, there are four different ways. When we have eight, there are eight different ways.
5. And when we have 10 vertices, there are 16 different ways to get from A to B.
6. Now my question to you is what if we had 20 vertices
7. and please again give your answer down here in this box?