GraphNode 0.10.0-8 API

```
public interface GraphNode<T extends Object>

                    
```
Graph node which represents the object as a part of some hierarchy
Classes implementing this interface should take care of equals and hashCode because they are used for testing the nodes for equality, and wrong implementation of these methods may lead to the wrong graph rendering, StackOverflow / OutOfMemory errors and so on. See example in NodeWrapper

Nested Class Summary

Nested Classes
Modifier and Type	Class	Description
`public class`	`GraphNode.Companion`

Method Summary

Modifier and Type	Method	Description
`abstract Label`	`getLabel()`	Node label with all required information
`abstract List<GraphNode<T>>`	`getInNodes()`	Nodes which are connected with the ingoing edges to this one: {this} <- {inNode}
`abstract List<GraphNode<T>>`	`getOutNodes()`	Nodes which are connected with the outgoing edges to this one: {this} -> {outNode}
`abstract List<GraphNode<T>>`	`getBiNodes()`	Nodes which are connected with the undirected edges to this one: {this} -- {biNode}

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Method Detail
  - getLabel
```
 abstract Label getLabel()
```
    Node label with all required information
  - getInNodes
```
 abstract List<GraphNode<T>> getInNodes()
```
    Nodes which are connected with the ingoing edges to this one: {this} <- {inNode}
  - getOutNodes
```
 abstract List<GraphNode<T>> getOutNodes()
```
    Nodes which are connected with the outgoing edges to this one: {this} -> {outNode}
  - getBiNodes
```
 abstract List<GraphNode<T>> getBiNodes()
```
    Nodes which are connected with the undirected edges to this one: {this} -- {biNode}