GraphNode

Type Parameters:

T - the actual implementation type of this graph node

All Known Subinterfaces:

BinaryTreeNode<T>, Matcher, MutableBinaryTreeNode<T>, MutableTreeNode<T>, Node<V>, TreeNode<T>

All Known Implementing Classes:

AbstractMatcher, ActionMatcher, AnyMatcher, AnyOfMatcher, CharIgnoreCaseMatcher, CharMatcher, CharRangeMatcher, CustomMatcher, EmptyMatcher, FirstOfMatcher, FirstOfStringsMatcher, ImmutableBinaryTreeNode, ImmutableGraphNode, ImmutableTreeNode, MemoMismatchesMatcher, MutableBinaryTreeNodeImpl, MutableTreeNodeImpl, NothingMatcher, OneOrMoreMatcher, OptionalMatcher, ProxyMatcher, SequenceMatcher, StringMatcher, TestMatcher, TestNotMatcher, VarFramingMatcher, ZeroOrMoreMatcher
```
public interface GraphNode<T extends GraphNode<T>>
```
A node in a directed graph (that may have cycles). The children list must not contain null entries.

- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  java.util.List<T> getChildren()
  Returns the sub nodes of this node.

- Method Detail
  - getChildren
```
java.util.List<T> getChildren()
```
    Returns the sub nodes of this node.
    
    Returns:
    
    the sub nodes