Package fr.uga.pddl4j.util

Class SquareBitMatrix

java.lang.Object

fr.uga.pddl4j.util.BitMatrix

fr.uga.pddl4j.util.SquareBitMatrix

All Implemented Interfaces:

Serializable

public class SquareBitMatrix
extends BitMatrix

This class implements a square bit matrix.

This class introspection mechanism not more allowed with jre version superior to 1.8.

See Also:

Serialized Form

Field Summary

Fields inherited from class fr.uga.pddl4j.util.BitMatrix

columns

Constructor Summary

Constructors

Constructor	Description
SquareBitMatrix(int size)	Creates a new squared matrix of a specific size.
SquareBitMatrix(SquareBitMatrix other)	Creates a deep copy from an other Square Bit Matrix.

Method Summary

Modifier and Type	Method	Description
void	transitiveClosure()	Compute the transitive closure of the ordering constraints.

Methods inherited from class fr.uga.pddl4j.util.BitMatrix

addRow, addRow, cardinality, clear, columns, equals, get, getColumn, getRow, hashCode, removeColumn, removeRow, resize, rows, set, set, toBitString, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Details

SquareBitMatrix

public SquareBitMatrix(SquareBitMatrix other)

Creates a deep copy from an other Square Bit Matrix.

Parameters:

other - The other matrix.

SquareBitMatrix

public SquareBitMatrix(int size)

Creates a new squared matrix of a specific size.

Parameters:

size - the size of the squared matrix.

Method Details

transitiveClosure

public final void transitiveClosure()

Compute the transitive closure of the ordering constraints. The computation of the transitive closure is based on Warshall algorithm. The complexity is O(n^3) where n is the number of tasks of the task network.