maximum-matching
Version:
Implementation of Blossom's Algorithm for Maximum Matching
15 lines (14 loc) • 503 B
TypeScript
import { Tree } from './Tree';
import { Node } from './Node';
export declare class Forest {
private readonly trees;
constructor(trees: Tree[]);
static fromRoots(roots: Node[]): Forest;
findTreeOf(node: Node): Tree | undefined;
findTreeOrFail(node: Node): Tree;
findSubtreeOrFail(node: Node): Tree;
has(node: Node): boolean;
pathToItsRootTree(node: Node): string[];
distanceToItsRootTree(node: Node): number;
areInTheSameTree(node1: Node, node2: Node): boolean;
}