|
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 Node
MaltChainedException
public void addOutgoingEdge(Edge out) throws MaltChainedException
addOutgoingEdge
in interface Node
MaltChainedException
public void removeIncomingEdge(Edge in) throws MaltChainedException
removeIncomingEdge
in interface Node
MaltChainedException
public void removeOutgoingEdge(Edge out) throws MaltChainedException
removeOutgoingEdge
in interface Node
MaltChainedException
public int getLeftmostProperDescendantIndex() throws MaltChainedException
ComparableNode
getLeftmostProperDescendantIndex
in interface ComparableNode
MaltChainedException
public int getRightmostProperDescendantIndex() throws MaltChainedException
ComparableNode
getRightmostProperDescendantIndex
in interface ComparableNode
MaltChainedException
public int getLeftmostDescendantIndex() throws MaltChainedException
ComparableNode
getLeftmostDescendantIndex
in interface ComparableNode
MaltChainedException
public int getRightmostDescendantIndex() throws MaltChainedException
ComparableNode
getRightmostDescendantIndex
in interface ComparableNode
MaltChainedException
public Iterator<Edge> getIncomingEdgeIterator()
getIncomingEdgeIterator
in interface Node
public Iterator<Edge> getOutgoingEdgeIterator()
getOutgoingEdgeIterator
in interface Node
public void clear() throws MaltChainedException
GraphElement
clear
in interface Element
clear
in class GraphElement
MaltChainedException
public int getInDegree()
ComparableNode
getInDegree
in interface ComparableNode
public int getOutDegree()
ComparableNode
getOutDegree
in interface ComparableNode
public SortedSet<Edge> getIncomingSecondaryEdges()
ComparableNode
getIncomingSecondaryEdges
in interface ComparableNode
public SortedSet<Edge> getOutgoingSecondaryEdges()
ComparableNode
getOutgoingSecondaryEdges
in interface ComparableNode
public 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 Node
MaltChainedException
public abstract boolean isRoot()
ComparableNode
isRoot
in interface ComparableNode
public boolean equals(Object obj)
equals
in class GraphElement
public int hashCode()
hashCode
in class GraphElement
public 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 |