TreeDecomposition::TreeWidthNodeSelector Class Reference

An abstract base class that supports generic node selectors for those tree width algorithms that compute upper bounds by computing perfect elimination schemes. ! More...

#include <treedex.h>

Inheritance diagram for TreeDecomposition::TreeWidthNodeSelector:

List of all members.

Public Member Functions
	TreeWidthNodeSelector (MyGraph &g)
virtual void	initialise ()=0
	Initialise the node selector.
virtual MyNodeId	getNextNode ()=0
	Return the id of the next node and delete it internally.
virtual void	update (MyNodeId deletedNodeId, set< MyNodeId > &neighbours)=0
Protected Attributes
MyGraph &	_graph

---

Detailed Description

An abstract base class that supports generic node selectors for those tree width algorithms that compute upper bounds by computing perfect elimination schemes. !

---

Member Function Documentation

virtual void TreeDecomposition::TreeWidthNodeSelector::update	(	MyNodeId	deletedNodeId,
		set< MyNodeId > &	neighbours
	)		[pure virtual]

Update the node selector based on the deletedNode and the neighbours of the deletedNode.

Warning:

deletedNode may not be a node in the graph.

Implemented in TreeDecomposition::TreeWidthNodeSelectorMinFillIn, and TreeDecomposition::TreeWidthNodeSelectorMinDegree.

---

The documentation for this class was generated from the following file:

• /home/poirel/src/c++/biorithm/libgraph/treedex.h