A tree width selector that prefer nodes with the smallest fill in ratio, i. e., the number of neighbour-pairs that are not adjacent divided by the total number of neighbour pairs. ! More...
#include <treedex.h>
Public Member Functions | |
| TreeWidthNodeSelectorMinFillInRatio (MyGraph &g) | |
Protected Types | |
|
typedef priority_queue < MyNodeFillInRatioPQNode, vector < MyNodeFillInRatioPQNode > , compareFillInRatioValues > | MyFillInRatioPQ |
Protected Attributes | |
| MyFillInRatioPQ | _npq |
A tree width selector that prefer nodes with the smallest fill in ratio, i. e., the number of neighbour-pairs that are not adjacent divided by the total number of neighbour pairs. !
1.7.6.1