| Class | Description |
|---|---|
| Arborescence<V> |
An arborescence is a directed graph in which, for the root and any other vertex,
there is exactly one directed path between them.
|
| ChuLiuEdmonds |
Chu-Liu-Edmonds' algorithm for finding a maximum branching in a complete, directed graph in O(n^2) time.
|
| ExclusiveEdge<V> |
An edge, together with a list of edges that can't be in the final answer if 'edge' is.
|
Copyright © 2017 Grakn Labs Ltd. All rights reserved.