1. 3. 2. 5. 1. 2. 1. x. 2. This was adjacency matrix after k=x and k=1 steps. Notice the shorter (green) path from x to 4. Now use k=3 and see how we pick it up. We do get to look at paths of length > 2!. 4. 4. 3. 3. X 1 2 3 4. X 1 2 3 4.

This was adjacency matrix after k=x and k=1 steps. Notice the shorter (green) path from x to 4.

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -