問題文
A transport operator wants to identify the stations that, if closed, would most disrupt travel between other pairs of stations. Which centrality algorithm is designed for that question?
選択肢
- Eigenvector Centrality, which gives a node a high score when it is connected to many nodes that themselves have high scores in the same computation over the graph.
- Weakly Connected Components, which finds sets of nodes that are connected to each other by some path when the direction of the relationships is ignored, and reports the component each node belongs to.
- Betweenness Centrality, which gives a node a high score when many shortest paths between other pairs of nodes run through it.
- Degree Centrality, which finds the stations with the most direct connections to their immediate neighbors elsewhere on the transport network.