gramoloss/lib/algorithms/inducedSubgraph.d.ts

Graph theory package for edition and computation

import { Graph } from "../graph";
import { Vertex, VertexIndex } from "../vertex";
/**
 * Returns the adjacencies list. (Can be seen as an abstract graph)
 * @param g
 * @param subset the subset of vertices to induce the graph (keep every arc xy when x and y are in subset)
 * @returns outNeighbors: Map<number, Set<number>> which tells for every vertex id the out-neighbors id of this vertex
 *
 */
export declare function getInducedSubgraph(g: Graph, subset: Set<Vertex>): {
    outNeighbors: Map<VertexIndex, Set<VertexIndex>>;
    inNeighbors: Map<VertexIndex, Set<VertexIndex>>;
};