A tree width selector that prefer nodes with the smallest fill in, i. e., the number of neighbour-pairs that are not adjacent. ! More...

#include <treedex.h>

Inheritance diagram for TreeDecomposition::TreeWidthNodeSelectorMinFillIn:

Public Member Functions
	TreeWidthNodeSelectorMinFillIn (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 Types
typedef priority_queue < MyNodeFillInRatioPQNode, vector < MyNodeFillInRatioPQNode > , compareFillInValues >	MyFillInPQ
Protected Member Functions
vector< NodeId >	getNeighbors (Graph &graph, NodeId nodeId)
unsigned int	computeFillIn (Graph &graph, NodeId nodeId)
Protected Attributes
MyFillInPQ	_npq

Detailed Description

A tree width selector that prefer nodes with the smallest fill in, i. e., the number of neighbour-pairs that are not adjacent. !

Member Function Documentation

virtual void TreeDecomposition::TreeWidthNodeSelectorMinFillIn::update	(	MyNodeId	deletedNodeId,
		set< NodeId > &	neighbours
	)		`[inline, virtual]`

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

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