ConnectedAndTreeComponent Class Reference
[Metric]

List of all members.

Detailed Description

ConnectedAndTreeComponent.h - Conected componnent and tree component decomposition.

This plugin implementation implements a decomposition of the graph into connected component and tree component (ie. subgraph that are tree and subgraph that are connected)

HISTORY

Note:
This algorithm assigns to each node a value defined as following : If two nodes are in the same connected component they have the same value else they have a different value.
Author:
David Auber University Bordeaux I France: Email:auber@tulip-software.org

Daniel Archambault University Of British Columbia

LICENCE

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.


Public Member Functions

 ConnectedAndTreeComponent (const PropertyContext &context)
void dfsErase (node n, Graph *sg, set< node > &deleted, MutableContainer< bool > &visited)
void startChainErase (node n, Graph *sg, set< node > &deleted)
bool run ()


Constructor & Destructor Documentation

ConnectedAndTreeComponent::ConnectedAndTreeComponent const PropertyContext &  context  )  [inline]
 


Member Function Documentation

void ConnectedAndTreeComponent::dfsErase node  n,
Graph *  sg,
set< node > &  deleted,
MutableContainer< bool > &  visited
[inline]
 

bool ConnectedAndTreeComponent::run  )  [inline]
 

void ConnectedAndTreeComponent::startChainErase node  n,
Graph *  sg,
set< node > &  deleted
[inline]
 


Generated on Fri Jan 5 14:21:36 2007 for Tulip Plugins by  doxygen 1.4.6