Extending the shortest-path swarm algorithm to cycle detection

Swarm programming is a method that uses many simple agents to collectively perform a complex task. The approach is based on the emergent behavior of a swarm of simple agents as they interact with each other and the environment. The swarming algorithms of our work extend the shortest path swarm agent algorithm. In this paper, we present four swarm algorithms used to discover graph cycles, along with respective performance analyses