UAVs Communication Redundancy Checking Graph Algorithm

In the paper UAVs communication redundancy checking graph algorithm is presented. Algorithm consists of several steps including vertex labelling and using known algorithms as Suurballe’s and Breadth-First Search’s (BFS). It may be applied to check whether between every two aircrafts of UAV swarm communication with redundancy is provided at the moment. The assumption is that solving the mentioned problem will allow us to identify UAVs configurations that may be susceptible to single points of failure.