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

# Kruskal(3tulip)

This selection plugins implements the so called Kruskal algorithm. This algorithm enables to find a minimum spanning tree in a connected graph.

## NAME

Kruskal -

This selection plugins implements the so called **Kruskal** algorithm. This algorithm enables to find a minimum spanning tree in a connected graph.

## SYNOPSIS

`#include <Kruskal.h>`

### Public Member Functions

**Kruskal** (const tlp::PropertyContext &)\
 **~Kruskal** ()\
 bool **run** ()\
 *Compute the Minimum Spanning Tree.*  bool **check** (std::string &)\

## Detailed Description

This selection plugins implements the so called **Kruskal** algorithm. This algorithm enables to find a minimum spanning tree in a connected graph.

This selection plugins enables to find all nodes and edges at a fixed distance of a set of nodes.

This only works on undirected graphs, (ie. the orientation of edges is omitted).

It takes one parameter :

- •

  \<DoubleProperty\> edge weight, this parameter defines the weight of each edge in the graph.

**Author:**

Anthony Don, LaBRI University Bordeaux I France:

## Constructor & Destructor Documentation

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

### Kruskal::~Kruskal ()

## Member Function Documentation

### bool Kruskal::check (std::string &)

### bool Kruskal::run ()

Compute the Minimum Spanning Tree.

## Author

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