#include <Kruskal.h>
This selection plugins enables to find all nodes and edges at a fixed distance of a set of nodes.
This working work on undirected graphs, (ie. the orientation of edges is ommitted).
It takes one parameter :
Public Member Functions | |
Kruskal (const tlp::PropertyContext &) | |
~Kruskal () | |
bool | run () |
Calcul l'arbre couvrant minimal. | |
bool | check (std::string &) |
Classes | |
struct | ltEdge |
|
|
|
|
|
|
|
Calcul l'arbre couvrant minimal.
|