Home

Getting started

Currently we do not provide the project as API. However you can directly use the source if you plan to use our algorithms.

• Take a look into the demo-package for more hints on how to use the algorithms.
  • There is a GUI demo and also one for the console

Algorithms

The project currently contains the following algorithms

• RandomTreeGenerator (author: Zabuza)
  • Generates an uniformly distributed random tree graph. The algorithm runs in O(n) where n is the size of the tree.
• LocalStorageExploration (implemented: Zabuza, research: Fraigniaud Pierre et al. in Collective Tree Exploration)
  • Uses robots (mobile agents) to distributedly explore a tree graph starting from the root. Robots are limited to local communication at the node they are currently located at. They do so by leaving and reading messages at those nodes. Thus they are not able to remotely communicate with each other. The algorithm runs with O(k / log k) overhead to the optimal exploration time, where k is the amount of robots.