cff-version: 1.2.0
abstract: "在确定网络图中端口之间没有直接连接后，请通过port.sol.com.cn，SeaRates.com和McDistance运输计算工具获得端口之间的直接连接距离。如果三个查询数据之间有较大差异，则使用平均值法进行优化，获得表端口距离。<br>Using the Floyd algorithm, the path between two ports in the port network graph is solved on the basis of the table Port Distance, there maybe multiple shortest paths between two ports, but this situation is  not considered here, the only result will be the result of Python simulation, get the table Port Shortest Path.<br>After get the Port Shortest Path, calculate the value of the shortest path between two ports, get the table Port Shortest Path Value.<br>According to the shortest path between two ports, count the number of routes for each port, then use the K-Medoids, construting the model of strategic importance of ports, get the table Number of ports are crossed by the shortest path.<br>根据“中间性中心性”模型的原理，通过“端口最短路径”表获得整个网络中每个端口的“中间性中心性”，然后使用K-Medoids来获得“端口中间性中心性”表。<br>表“端口通过次数组”和“中间性组”表的值和内容组合在一起，得到表“总组”，以方便数据搜索。<br><br>"
authors:
  - family-names: Yang
    given-names: Zihui
    orcid: "https://orcid.org/0000-0003-3046-9793"
title: "Dataset about Port Research"
keywords:
version: 2
identifiers:
  - type: doi
    value: 10.4121/14298851.v2
license: CC0
date-released: 2021-03-31