フリー問題

Neo4j Graph Data Science Certification のフリー問題 7 / 20 問目

問題文

In a delivery network, a planner wants to find the depots from which goods can reach all other locations in the fewest total steps. What does Closeness Centrality measure that fits this?

選択肢

  1. The inverse of the sum of a node's distances to all other nodes, so a node with short distances to everything else scores high.
  2. The number of shortest paths that pass through the node, which identifies the locations that sit between the others on the routes through the network.
  3. The share of the node's neighbors that are also connected to each other, expressed as a value between zero and one, which describes how tightly the neighborhood is knit together around that node.
  4. The number of relationships attached to the node, weighted by the sum of the positive values found on the relationship property used as the weight for the run.

解答・解説を確認するには

正解と解説の確認、回答の記録には無料登録が必要です。登録すると演習モードでフリー問題に回答し、正誤と解説をその場で確認できます。