Research on the Shortest Hyperpath Algorithm of Hypernetwork and Its Application

Abstract

Hypernetwork based on the theory of hypergraph can better describe some problems which complex network cannot describe. Many scholars pay more attention to hypernetwork theory study. From a literature review, There are many researches on the theory of hypernetwork, but the research on the shortest hyperpath analysis algorithm of hypernetwork is a blank at present. In this paper, based on the incidence matrix of hypergraph, we use the combination of iterative algorithm and breadth-first algorithm and depth-first algorithm to calculate the shortest distance between any two points in the hypernetwork, and then calculates the maximum diameter of hypernetwork, average of hyperpath length, the propagation efficiency of hypernetwork, nodes and hyperedges of betweenness of hypernetwork are further calculated according to the shortest distance between any two points. These studies are the basis of exploring the dynamic mechanism of hypernetwork.