Package | Description |
---|---|
de.tudresden.inf.lat.jcel.core.algorithm.rulebased |
Provides interfaces and classes to run a classification
algorithm based on completion rules.
|
de.tudresden.inf.lat.jcel.core.completion.common |
Provides common interfaces and classes for the rules of the classification
algorithm.
|
de.tudresden.inf.lat.jcel.core.graph |
Provides interfaces and classes used to represent the data
during the classification process.
|
Modifier and Type | Method and Description |
---|---|
VNode |
ClassifierStatusImpl.getNode(int nodeId) |
Modifier and Type | Method and Description |
---|---|
boolean |
ClassifierStatusImpl.contains(VNode node) |
int |
ClassifierStatusImpl.createOrGetNodeId(VNode node) |
Modifier and Type | Method and Description |
---|---|
VNode |
ClassifierStatus.getNode(int nodeId)
Returns the node for a given node identifier.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ClassifierStatus.contains(VNode node)
Returns whether a particular node belongs to the set V.
|
int |
ClassifierStatus.createOrGetNodeId(VNode node)
Gets the identifier of a node, or creates a new one.
|
Modifier and Type | Class and Description |
---|---|
class |
VNodeImpl
This class implements a node which is a pair of a class and a set of
existential expressions.
|
Modifier and Type | Method and Description |
---|---|
boolean |
VNodeImpl.addExistentialsOf(VNode other)
Adds the existential pairs of another node.
|
Copyright © 2009–2015 Chair of Automata Theory - TU Dresden. All rights reserved.