|
MaltParser 1.4.1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjava.util.Observable
org.maltparser.core.syntaxgraph.GraphElement
org.maltparser.core.syntaxgraph.node.GraphNode
public abstract class GraphNode
| Field Summary | |
|---|---|
protected SortedSet<Edge> |
incomingEdges
|
protected SortedSet<Edge> |
outgoingEdges
|
| Constructor Summary | |
|---|---|
GraphNode()
|
|
| Method Summary | |
|---|---|
void |
addIncomingEdge(Edge in)
|
void |
addOutgoingEdge(Edge out)
|
void |
clear()
Resets the graph element. |
int |
compareTo(ComparableNode o)
|
boolean |
equals(Object obj)
|
Iterator<Edge> |
getIncomingEdgeIterator()
|
SortedSet<Edge> |
getIncomingSecondaryEdges()
Returns a sorted set of incoming secondary edges. |
int |
getInDegree()
Returns the in degree of the node (number of incoming edges of all types of edges). |
abstract int |
getIndex()
Returns the index of the node. |
int |
getLeftmostDescendantIndex()
Returns the index of the left-most terminal descendant node. |
int |
getLeftmostProperDescendantIndex()
Returns the index of the left-most proper terminal descendant node (excluding itself). |
int |
getOutDegree()
Returns the out degree of the node (number of outgoing edges of all types of edges). |
Iterator<Edge> |
getOutgoingEdgeIterator()
|
SortedSet<Edge> |
getOutgoingSecondaryEdges()
Returns a sorted set of outgoing secondary edges. |
int |
getRightmostDescendantIndex()
Returns the index of the right-most terminal descendant node. |
int |
getRightmostProperDescendantIndex()
Returns the index of the right-most proper terminal descendant node (excluding itself). |
int |
hashCode()
|
abstract boolean |
isRoot()
Returns true if the node is a root node, otherwise false. |
void |
removeIncomingEdge(Edge in)
|
void |
removeOutgoingEdge(Edge out)
|
abstract void |
setIndex(int index)
|
String |
toString()
|
| Methods inherited from class org.maltparser.core.syntaxgraph.GraphElement |
|---|
addLabel, addLabel, addLabel, compareTo, getBelongsToGraph, getLabelCode, getLabelSet, getLabelSymbol, getLabelTypes, hasLabel, isLabeled, nLabels, removeLabel, removeLabels, setBelongsToGraph |
| Methods inherited from class java.util.Observable |
|---|
addObserver, clearChanged, countObservers, deleteObserver, deleteObservers, hasChanged, notifyObservers, notifyObservers, setChanged |
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface org.maltparser.core.syntaxgraph.node.ComparableNode |
|---|
getCompareToIndex, getLeftmostDescendant, getLeftmostProperDescendant, getRightmostDescendant, getRightmostProperDescendant |
| Methods inherited from interface org.maltparser.core.syntaxgraph.Element |
|---|
addLabel, addLabel, addLabel, getBelongsToGraph, getLabelCode, getLabelSet, getLabelSymbol, getLabelTypes, hasLabel, isLabeled, nLabels, removeLabel, removeLabels, setBelongsToGraph |
| Field Detail |
|---|
protected SortedSet<Edge> incomingEdges
protected SortedSet<Edge> outgoingEdges
| Constructor Detail |
|---|
public GraphNode()
throws MaltChainedException
MaltChainedException| Method Detail |
|---|
public void addIncomingEdge(Edge in)
throws MaltChainedException
addIncomingEdge in interface NodeMaltChainedException
public void addOutgoingEdge(Edge out)
throws MaltChainedException
addOutgoingEdge in interface NodeMaltChainedException
public void removeIncomingEdge(Edge in)
throws MaltChainedException
removeIncomingEdge in interface NodeMaltChainedException
public void removeOutgoingEdge(Edge out)
throws MaltChainedException
removeOutgoingEdge in interface NodeMaltChainedException
public int getLeftmostProperDescendantIndex()
throws MaltChainedException
ComparableNode
getLeftmostProperDescendantIndex in interface ComparableNodeMaltChainedException
public int getRightmostProperDescendantIndex()
throws MaltChainedException
ComparableNode
getRightmostProperDescendantIndex in interface ComparableNodeMaltChainedException
public int getLeftmostDescendantIndex()
throws MaltChainedException
ComparableNode
getLeftmostDescendantIndex in interface ComparableNodeMaltChainedException
public int getRightmostDescendantIndex()
throws MaltChainedException
ComparableNode
getRightmostDescendantIndex in interface ComparableNodeMaltChainedExceptionpublic Iterator<Edge> getIncomingEdgeIterator()
getIncomingEdgeIterator in interface Nodepublic Iterator<Edge> getOutgoingEdgeIterator()
getOutgoingEdgeIterator in interface Node
public void clear()
throws MaltChainedException
GraphElement
clear in interface Elementclear in class GraphElementMaltChainedExceptionpublic int getInDegree()
ComparableNode
getInDegree in interface ComparableNodepublic int getOutDegree()
ComparableNode
getOutDegree in interface ComparableNodepublic SortedSet<Edge> getIncomingSecondaryEdges()
ComparableNode
getIncomingSecondaryEdges in interface ComparableNodepublic SortedSet<Edge> getOutgoingSecondaryEdges()
ComparableNode
getOutgoingSecondaryEdges in interface ComparableNodepublic int compareTo(ComparableNode o)
compareTo in interface Comparable<ComparableNode>public abstract int getIndex()
ComparableNode
getIndex in interface ComparableNode
public abstract void setIndex(int index)
throws MaltChainedException
setIndex in interface NodeMaltChainedExceptionpublic abstract boolean isRoot()
ComparableNode
isRoot in interface ComparableNodepublic boolean equals(Object obj)
equals in class GraphElementpublic int hashCode()
hashCode in class GraphElementpublic String toString()
toString in class GraphElement
|
MaltParser 1.4.1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||