An Improved Strong Connectivity Discriminant Algorithm for Complex Directed Networks

The existing network connectivity discriminant algorithms have high time complexity, which could not satisfy the requirement of quick connectivity discrimination for large-scale networks, such as computer networks, communication networks and energy networks, etc. Aiming at the strong connectivity discriminant problem of directed networks, this paper extends the Warshall algorithm from simple directed networks to complex ones and gives an improved discriminant algorithm, which can reduce the time complexity of the Warshall algorithm by half. This is of great practical value to the connectivity discrimination for various large-scale complex directed networks.