Got a YouTube account?

New: enable viewer-created translations and captions on your YouTube channel!

English subtitles

← Intro 9.2 Network Terminology (Answer 1)

Get Embed Code
4 Languages

Showing Revision 1 created 01/25/2015 by Noos-xH.

  1. For the first question,
  2. Alan has a degree of 4,
  3. where as every other node in the network
  4. has a degree of 2.
  5. So Alan has the highest degree.
  6. The shortest path between Sara and Lynn is 2 hops;
  7. 1 to Alan, than to Lynn.
  8. The maximum shortest path between
  9. any node in the network, that's asking what is
  10. the maximum number of hops to get from
  11. one node to any other node,
  12. and you can see that to go through Alan here,
  13. the maximum is 2.