The Trees type exposes the following members.

# Methods

Name | Description | |
---|---|---|

CollectSubtree | Collects all nodes of the subtree starting with root. | |

DirectTree(Graph) |
Reverses some edges of the given tree such that it is
a directed rooted tree afterwards.
| |

DirectTree(Graph, Node) |
Reverses some edges of the given tree such that it is
a directed rooted tree with the given node as root element.
| |

Equals | Determines whether the specified Object is equal to the current Object. (Inherited from Object.) | |

Finalize | Allows an object to try to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. (Inherited from Object.) | |

GetCenterRoot | Returns the center node of an undirected tree. | |

GetHashCode | Serves as a hash function for a particular type. (Inherited from Object.) | |

GetLeafNodes | Returns all leaf nodes of the given tree. | |

GetNearestCommonAncestor | Returns the nearest common ancestor of a subset of nodes within a directed rooted tree. | |

GetRoot | Returns a possible root for the given (undirected) tree. | |

GetSubTreeDepths | Returns for a rooted directed tree the depths of each of its subtrees. | |

GetSubTreeSizes | Returns for a rooted directed tree the size (number of nodes) of each of its subtrees. | |

GetTreeEdges(Graph) |
Returns an array of EdgeList objects each containing edges that belong to a
maximal directed subtree of the given graph.
| |

GetTreeEdges(Graph, array<NodeList>[]()[][]) |
Same as
GetTreeEdges(Graph)
but more efficient if
the treeNodes where calculated before by
GetTreeNodes(Graph)
.
| |

GetTreeNodes |
Returns an array of NodeList objects each containing nodes
that belong to a maximal directed subtree
of the given graph.
| |

GetType | Gets the Type of the current instance. (Inherited from Object.) | |

GetUndirectedTreeNodes |
Returns an array of NodeList objects each containing nodes
that belong to a maximal undirected subtree
of the given graph.
| |

GetWeightedCenterNode(Graph) |
Finds a node which is used by the greatest number of all (undirected) paths interconnecting
all nodes with each other.
| |

GetWeightedCenterNode(Graph, INodeMap) |
Finds a node which is used by the greatest number of all (undirected) paths interconnecting
all nodes with each other.
| |

IsForest(Graph) |
Checks whether the given graph is a forest, that is,
a graph whose connected components are directed rooted trees.
| |

IsForest(Graph, Boolean) | Checks whether the given graph is a forest. | |

IsNaryTree |
Checks whether the given graph is a directed rooted tree where each
node has a maximum of n children.
| |

IsRootedTree | Checks whether the given graph is a directed rooted tree. | |

IsTree | Checks whether or not the given graph is an undirected tree. | |

MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |

ToString | Returns a string that represents the current object. (Inherited from Object.) |