Uses of Class
uk.ac.manchester.cs.jfact.kernel.DlCompletionTreeArc

Packages that use DlCompletionTreeArc

Package	Description
uk.ac.manchester.cs.jfact.kernel

Uses of DlCompletionTreeArc in uk.ac.manchester.cs.jfact.kernel

Methods in uk.ac.manchester.cs.jfact.kernel that return DlCompletionTreeArc

Modifier and Type	Method and Description
DlCompletionTreeArc	DlCompletionGraph.addRoleLabel(DlCompletionTree from, DlCompletionTree to, boolean isPredEdge, Role r, DepSet dep) add role R with dep-set DEP to the label of the TO arc
DlCompletionTreeArc	DlCompletionGraph.createLoop(DlCompletionTree node, Role r, DepSet dep) Create an R-loop of NODE wrt dep-set DEP;
DlCompletionTreeArc	DlCompletionGraph.createNeighbour(DlCompletionTree from, boolean isPredEdge, Role r, DepSet dep) Create an empty R-neighbour of FROM;
DlCompletionTreeArc	DlCompletionTree.getEdgeLabelled(Role r, DlCompletionTree node) check if edge to NODE is labelled by R;
DlCompletionTreeArc	DlCompletionTreeArc.getReverse()

Methods in uk.ac.manchester.cs.jfact.kernel that return types with arguments of type DlCompletionTreeArc

Modifier and Type	Method and Description
List<DlCompletionTreeArc>	DlCompletionTree.getNeighbour()

Methods in uk.ac.manchester.cs.jfact.kernel with parameters of type DlCompletionTreeArc

Modifier and Type	Method and Description
void	DlCompletionTree.addNeighbour(DlCompletionTreeArc p) add given arc P as a neighbour
void	DlCompletionTreeArc.setReverse(DlCompletionTreeArc v) set given arc as a reverse of current
boolean	DlSatTester.setupEdge(DlCompletionTreeArc pA, DepSet dep, int flags)

Method parameters in uk.ac.manchester.cs.jfact.kernel with type arguments of type DlCompletionTreeArc

Modifier and Type	Method and Description
void	DlCompletionGraph.merge(DlCompletionTree from, DlCompletionTree to, DepSet dep, List<DlCompletionTreeArc> edges) merge labels; see SHOIN paper for detailed description