selection

Langue: en

Version: 277930 (debian - 07/07/09)

Section: 3 (Bibliothèques de fonctions)

Sommaire

NAME

Selection -

Classes


class InducedSubGraphSelection
This selection plugins enables to find a subgraph induced by a set of nodes.
class Kruskal
This selection plugins implements the so called Kruskal algorithm. This algorithm enables to find a minimum spanning tree in a connected graph.
class LoopSelection

class MultipleEdgeSelection

class ReachableSubGraphSelection

class SpanningDagSelection

class SpanningTreeSelection

Detailed Description

Authors: David Auber, Patrick Mary, Morgan Mathiaut from the LaBRI Visualization Team Email : auber@tulip-software.org Last modification : 13/03/2009 This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

Author

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