Cycle Discovery in Graphs using Swarm Intelligence

摘要

Swarm Intelligence 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. This paper presents a swarm agent algorithm that can be used to discover cycles in a graph. This algorithm is an extension of the shortest path swarm agent algorithm. Both algorithms are discussed and preliminary results from the cycle discovery agents are presented.