il2.inf.structure.minfill2
Class MinfillEoe
Object
EliminationOrderEngine
MinfillEoe
public class MinfillEoe
- extends EliminationOrderEngine
An EliminationOrderEngine that uses minfill.
- Author:
- Mark Chavira
Method Summary |
void |
begin(int[] cardinalities,
int[][] adj,
int[] adjSize,
boolean[] marked)
Allocates subclass resources. |
void |
end()
Frees subclass resources. |
void |
updateCosts(int[][] adj,
int[] adjSize,
int removed,
boolean[] marked,
boolean[][] marked2,
IntPriorityQueue pq)
Updates the costs of nodes after the removal of edges extending from
neighbors of the removed node to the removed node. |
MinfillEoe
public MinfillEoe()
begin
public void begin(int[] cardinalities,
int[][] adj,
int[] adjSize,
boolean[] marked)
- Description copied from class:
EliminationOrderEngine
- Allocates subclass resources.
- Parameters:
cardinalities
- maps each node to its cardinality.adj
- maps each node to its adjacency list.adjSize
- maps each node to the size of its adjacency list.marked
- a map from each node to boolean that maps every node to
false, may be used as scratch, and must be returned to an all false
state upon exit.- See Also:
EliminationOrderAlgorithm
end
public void end()
- Description copied from class:
EliminationOrderEngine
- Frees subclass resources.
- See Also:
EliminationOrderAlgorithm
updateCosts
public void updateCosts(int[][] adj,
int[] adjSize,
int removed,
boolean[] marked,
boolean[][] marked2,
IntPriorityQueue pq)
throws Exception
- Description copied from class:
EliminationOrderEngine
- Updates the costs of nodes after the removal of edges extending from
neighbors of the removed node to the removed node.
- Parameters:
adj
- the map from node to adjacency list.adjSize
- the map from node to adjacency list size.removed
- the node that was removed.marked
- a map from each node to whether or not it is the removed
node or it is a one-hop neighbor of the removed node.
- Throws:
Exception
- See Also:
EliminationOrderAlgorithm
Copyright 2010 UCLA Automated Reasoning Group