Package edu.pitt.isp.sverchkov.data
Class AdTree<A,V>
java.lang.Object
edu.pitt.isp.sverchkov.data.AdTree<A,V>
- All Implemented Interfaces:
Serializable
An implementation of a static AD tree based on Moore and Lee 1998 (mostly)
Indexing of the variables works backwards: (a_i can't have children a_i ... a_m) ... not that that difference is visible in the API.
- Author:
- user
- See Also:
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprotected int
count
(int[] assignment, edu.pitt.isp.sverchkov.data.AdTreeHelper.CountNode ptr) int
toXML()
toXML
(DocumentBuilder builder)
-
Field Details
-
m
protected final int m -
airities
protected final int[] airities
-
-
Constructor Details
-
AdTree
-
-
Method Details
-
values
-
count
-
counts
-
toXML
- Throws:
ParserConfigurationException
-
toXML
-
count
protected int count(int[] assignment, edu.pitt.isp.sverchkov.data.AdTreeHelper.CountNode ptr)
-