@crstrskp/graph/dist/GraphImpl.d.ts

High-performance TypeScript graph algorithms library optimized for trading bots and arbitrage detection

import { Edge } from "./Edge";
import { IGraph } from "./IGraph";
import { Vertex } from './Vertex';
import { IGraphSearch } from "./IGraphSearch";
import { Path } from "./Path";
import { Attributes } from "./types/Attributes";
export declare class GraphImpl implements IGraph, IGraphSearch {
    edges: Edge[];
    vertices: Vertex[];
    private vertexMap;
    attributes: Attributes;
    constructor();
    private static idCounter;
    static generateId(): number;
    bellmanFord(src: Vertex): Map<Vertex, number>;
    bellmanFord_shortestPath(src: Vertex, dest: Vertex): Path;
    bmf_print(bmf: Map<Vertex, number>): void;
    bmf_negativeCycles(): Path[];
    private extractNegativeCycle;
    dijkstra_shortestPath(src: Vertex, dest: Vertex): Path;
    setAttribute(key: string, value: any): void;
    getAttribute(key: string): any;
    getVertexByLabel(label: string): Vertex | undefined;
    getVertexById(id: number): Vertex | undefined;
    getEdgeById(id: number): Edge | undefined;
    getAllVertices(): Vertex[];
    getAllEdges(): Edge[];
    getIncidentEdges(v: Vertex): Edge[];
    getIncidentStartEdges(v: Vertex): Edge[];
    getIncidentEndEdges(v: Vertex): Edge[];
    getOpposite(v: Vertex, e: Edge): Vertex | undefined;
    getVertices(e: Edge): Vertex[];
    getAdjacentVertices(v: Vertex): Vertex[];
    areAdjacent(v: Vertex, w: Vertex): boolean;
    insertVertex(o: any): Vertex;
    isOfTypeVertex(input: any): boolean;
    insertEdge(v: Vertex, w: Vertex, o: any): Edge;
    removeVertex(v: Vertex): void;
    removeEdge(e: Edge): void;
    /**
     *
     * @param edges list of edges to be sorted
     * @returns a new list of sorted edges
     */
    sortEdgesASC(edges: Edge[]): Edge[];
    /**
     *
     * @param edges list of edges to be sorted
     * @returns a new list of sorted edges
     */
    sortEdgesDESC(edges: Edge[]): Edge[];
}
//# sourceMappingURL=GraphImpl.d.ts.map