---
name: "ImprovedWalker"
section: "3tulip"
platform: "linux"
package: "tulip-doc"
version: "3.1.2-2.3"
release: "Debian 6.0 (Squeeze)"
platforms: ["linux"]
url: "https://new.carta.tech/ImprovedWalker"
---

# ImprovedWalker(3tulip)

## NAME

ImprovedWalker -

## SYNOPSIS

`#include <ImprovedWalker.h>`

### Public Member Functions

**ImprovedWalker** (const tlp::PropertyContext &)\
 **~ImprovedWalker** ()\
 bool **run** ()\

### Friends

class **ImprovedWalkerUnitTests**\

## Detailed Description

This plugin is an implementation of a linear Walker's algorithm:

Christoph Buchheim and Michael Junger and Sebastian Leipert, Improving Walker's Algorithm to Run in Linear Time citeseer.ist.psu.edu/buchheim02improving.html

**Note:**

This algorith works on tree. Let n be the number of nodes, the algorithm complexity is in O(n).

**Author:**

Julien Testut, Antony Durand, Pascal Ollier, Yashvin Nababsing, \
\
  Sebastien Leclerc, Thibault Ruchon, Eric Dauchier \
\
  University Bordeaux I France

## Constructor & Destructor Documentation

### ImprovedWalker::ImprovedWalker (const tlp::PropertyContext &)

### ImprovedWalker::~ImprovedWalker ()

## Member Function Documentation

### bool ImprovedWalker::run ()

## Friends And Related Function Documentation

### friend class ImprovedWalkerUnitTests` [friend]`

## Author

Generated automatically by Doxygen for Tulip Plugins Library from the source code.