BALL::TreeWidthImplementation< EditableGraph >::FillInHeuristic Struct Reference

#include <BALL/DATATYPE/GRAPH/treeWidth.h>

Public Member Functions
VertexType &	operator() (UndirectedGraph &graph)
Size	edgeIncreaseByEliminating (VertexIterator vertex, UndirectedGraph &graph)

Detailed Description

template<class EditableGraph>
struct BALL::TreeWidthImplementation< EditableGraph >::FillInHeuristic

A criterium for GreedyFillIn which search for a vertex with minimum number of additional edges after eliminating

Definition at line 299 of file treeWidth.h.

Member Function Documentation

template<class EditableGraph >

Size BALL::TreeWidthImplementation< EditableGraph >::FillInHeuristic::edgeIncreaseByEliminating	(	VertexIterator	vertex,
		UndirectedGraph &	graph
	)

template<class EditableGraph >

VertexType& BALL::TreeWidthImplementation< EditableGraph >::FillInHeuristic::operator()

(

UndirectedGraph &

graph

)