BALL 1.5.0
|
#include <BALL/DATATYPE/GRAPH/treeWidth.h>
Public Member Functions | |
VertexType & | operator() (UndirectedGraph &graph) |
Size | edgeIncreaseByEliminating (VertexIterator vertex, UndirectedGraph &graph) |
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.
Size BALL::TreeWidthImplementation< UndirectedGraph >::FillInHeuristic::edgeIncreaseByEliminating | ( | VertexIterator | vertex, |
UndirectedGraph & | graph ) |
VertexType & BALL::TreeWidthImplementation< UndirectedGraph >::FillInHeuristic::operator() | ( | UndirectedGraph & | graph | ) |