[This is preliminary documentation and is subject to change.]
Contains interfaces and implementations for various generic data structures other than collections.
Classes
| Class | Description | |
|---|---|---|
 | Graph | Represents whole graph, implements graph alghoritms |
| GraphAlghoritmData | Data used by graph alghoritm |
| GraphEdge | Represents graph edge |
| GraphNode | Represents graph node |
| InvalidGraphException | Exception thrown when Graph is in invalid for specific alghoritm |
| Pair<(Of <(<'T>)>)> | Limits Pair<(Of <(<'T1, T2>)>)> to contain only values of the same type |
| Pair<(Of <(<'T1, T2>)>)> | Implements IPair<(Of <(<'T1, T2>)>)> as reference type |
| T1orT2<(Of <(<'T1, T2>)>)> | Implements type that can contain either value of type T1 ore value of type T2. It cannot contain both values at the same time. |
| Tree | Contains shared utilities for all trees |
| Tree<(Of <(<'T>)>)> | Represents tree or sub-tree |
| Tree<(Of <(<'T>)>)>..::..TreeEnumerator | Enumerates through Tree<(Of <(<'T>)>)> (or its sub-tree) in given order |
Interfaces
| Interface | Description | |
|---|---|---|
 | IPair<(Of <(<'T1, T2>)>)> | Type tha contains value of two distinct types |
| IT1orT2<(Of <(<'T1, T2>)>)> | Represents type that can contain either value of type T1 or value of type T2. It cannot contain both values at the same time. |
Enumerations
| Enumeration | Description | |
|---|---|---|
 | GraphNodeState | Possible states of graph node while alghoritm is running |
| Tree..::..EnumDirections | Directions of tree enumerationg |
| Tree..::..EnumOrders | Tree enumeration orders |
