---
name: "ReachableSubGraphSelection"
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/ReachableSubGraphSelection"
---

# ReachableSubGraphSelection(3tulip)

## NAME

ReachableSubGraphSelection -

## SYNOPSIS

`#include <ReachableSubGraphSelection.h>`

### Public Member Functions

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

## Detailed Description

This selection plugin enables to find all nodes and edges at a fixed distance of a set of nodes. It takes three parameters :

- •

  \<int\> distance

- •

  \<int\> direction : 0 means directed, 1 reverse directed, 2 undirected

- •

  \<BooleanProperty \*\> startingnodes : the selected nodes of this BooleanProperty (those whose associated value is true) will be used as starting nodes.

**Author:**

David Auber, LaBRI University Bordeaux I France: auber@tulip-software.org

## Constructor & Destructor Documentation

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

### ReachableSubGraphSelection::~ReachableSubGraphSelection ()

## Member Function Documentation

### bool ReachableSubGraphSelection::run ()

\===========================================================

## Author

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