TreeDecomposition::TreeWidthNodeSelectorMinDegree Class Reference

A tree width selector that prefer nodes with the smallest degree. ! More...

#include <treedex.h>

Inheritance diagram for TreeDecomposition::TreeWidthNodeSelectorMinDegree:

List of all members.

Public Member Functions
	TreeWidthNodeSelectorMinDegree (MyGraph &g)
virtual void	initialise ()
	Initialise the node selector.
virtual MyNodeId	getNextNode ()
	Return the id of the next node and delete it internally.
virtual void	update (MyNodeId deletedNodeId, set< NodeId > &neighbours)
Protected Attributes
unsigned int	_minDegree
vector< list< MyNodeId > >	_degreeLists
map< MyNodeId, list< MyNodeId > ::iterator >	_nodePositions

---

Detailed Description

A tree width selector that prefer nodes with the smallest degree. !

---

Member Function Documentation

virtual void TreeDecomposition::TreeWidthNodeSelectorMinDegree::update	(	MyNodeId	deletedNodeId,
		set< NodeId > &	neighbours
	)		[inline, 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.

Implements TreeDecomposition::TreeWidthNodeSelector.

---

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

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