Consider the following network: (a) Which of the following most accurately describes the connectedness of this network? Strongly Weakly Disconnected None of the above (b) When discussing path lengths on a weighted graph, one must first define how the weights are related to the length of a path between two nodes is then the sum of the distances of the links in that path. Consider the previous network and assume that the link weights represent distances. Using this distance metric, what is the shortest path between nodes 1 and 6? (c) A common way to define the distance between two nodes is the inverse (or reciprocal) of the link weight. Consider the previous network and assume that the distance between two adjacent nodes is defined as the reciprocal of the link weight. Using this distance metric, what is the shortest path between node 1 and 6?
- Consider the following network:
(a) Which of the following most accurately describes the connectedness of this network?
-
- Strongly
- Weakly
- Disconnected
- None of the above
(b) When discussing path lengths on a weighted graph, one must first define how the weights are related to the length of a path between two nodes is then the sum of the distances of the links in that path. Consider the previous network and assume that the link weights represent distances. Using this distance metric, what is the shortest path between nodes 1 and 6?
(c) A common way to define the distance between two nodes is the inverse (or reciprocal) of the link weight. Consider the previous network and assume that the distance between two adjacent nodes is defined as the reciprocal of the link weight. Using this distance metric, what is the shortest path between node 1 and 6?
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 8 images