Abstract: The existing studies show that the network structure can be enhanced by constructing subgraph network based on subgraph interaction relationship, but the complexity of such algorithms is high. In view of this, this paper weights the original network based on the topological attributes of different order subgraph networks, obtains the first-order and second-order weighted networks, and intuitively reflects the interaction relationships of subgraphs in the form of weights. At the same time, the weights of the two weighted networks can be calculated directly through the topology of the original network, which avoids the construction process of subgraph network and greatly reduces the complexity of the algorithm. Finally, the key nodes identification task is taken as the research object to illustrate the performance of the two weighted networks in the application of structure mining. In this paper, two new centrality indices are defined based on weighted networks, which are compared with seven classical centrality indices in eight real networks. The experimental results show that the centrality indices based on weighted network has better performance.