Overview     Modules     Class Hierarchy     Classes     Members  

Kruskal Class Reference
[Selection]

#include <Kruskal.h>

List of all members.


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 working work on undirected graphs, (ie. the orientation of edges is ommitted).

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:

Public Member Functions

  • Kruskal (const tlp::PropertyContext &)
  • ~Kruskal ()
  • bool run ()
    Calcul l'arbre couvrant minimal.
  • bool check (std::string &)

Classes

  • struct ltEdge

Constructor & Destructor Documentation

Kruskal::Kruskal const tlp::PropertyContext &   ) 
 

Kruskal::~Kruskal  ) 
 


Member Function Documentation

bool Kruskal::check std::string &   ) 
 

bool Kruskal::run  ) 
 

Calcul l'arbre couvrant minimal.



Tulip Software by David AUBER    2001 - 2006