| Interface | Description |
|---|---|
| IEliminationHeuristic |
| Class | Description |
|---|---|
| GraphElimination |
Graph elimination based on greedy minimum fill-in heuristic.
|
| MinDegree | |
| MinFillIn | |
| QuotientGraph |
Quotient graphs are special data structures for the perfect elimination order problem.
|
Copyright © 2018. All rights reserved.