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.

After get the Port Shortest Path, calculate the value of the shortest path between two ports, get the table Port Shortest Path Value.

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 Port Passes Number Group.

According to the principle of the Betweenness Centrality model, the Betweenness Centrality of each port in the whole network is obtained by the table Port Shortest Path, and then use the K-Medoids, get the table Betweenness Centrality Group.

The values and contents of the table Port Passes Number Group and the table Betweenness Centrality Group are combined together to get the table Total Group to facilitate data search.

ER -