gramoloss/lib/algorithms/bruteforce.d.ts

Graph theory package for edition and computation

import { Graph } from "../graph";
/**
 * Bruteforce algorithm which tries every 2^V subset of the vertices of G.
 * @param g
 * @param property meta property on a graph
 * @param verbose if true, prints all the solutions
 * @returns minimum, nbMinSolutions, nbSolutions
 */
export declare function bruteforceMinSubsetVertices(g: Graph, property: (g: Graph, subset: Set<number>) => boolean, verbose: boolean): {
    minimum: number;
    nbMinSolutions: number;
    nbSolutions: number;
};