@sandeepsj0000/react-graph-visualizer 1.0.0

package/dist/graphEngine.d.ts

@@ -0,0 +1,96 @@
+import { GraphData, GraphEdge, GraphNode, PathResult, NodeInfo, GraphStats, SubgraphResult } from "./types";
+export declare class GraphEngine {
+    private adjacency;
+    private incomingAdjacency;
+    private directed;
+    private edges;
+    private nodes;
+    private labelMap;
+    private nodeMap;
+    constructor(data: GraphData);
+    /** Get display label for a node */
+    getLabel(id: string): string;
+    /** Get full node object by id */
+    getNode(id: string): GraphNode | undefined;
+    /** Get all node ids */
+    getNodeIds(): string[];
+    /** Get all nodes */
+    getNodes(): GraphNode[];
+    /** Get all edges */
+    getEdges(): GraphEdge[];
+    /** Check if a node exists */
+    hasNode(id: string): boolean;
+    /** Check if an edge exists between source and target */
+    hasEdge(source: string, target: string): boolean;
+    /** Get rich info about a node: label, degree, neighbors */
+    getNodeInfo(nodeId: string): NodeInfo | null;
+    /** Get all directly connected nodes (outgoing + incoming for directed, all for undirected) */
+    getConnectedNodes(nodeId: string): string[];
+    /** Get connected nodes with labels */
+    getConnectedNodesWithLabels(nodeId: string): {
+        id: string;
+        label: string;
+    }[];
+    /** Get only outgoing neighbors (directed graphs) */
+    getOutgoingNeighbors(nodeId: string): string[];
+    /** Get only incoming neighbors (directed graphs) */
+    getIncomingNeighbors(nodeId: string): string[];
+    /** Out-degree of a node */
+    getOutDegree(nodeId: string): number;
+    /** In-degree of a node */
+    getInDegree(nodeId: string): number;
+    /** Total degree (unique neighbors count) */
+    getDegree(nodeId: string): number;
+    /** Get all nodes NOT connected to the given node */
+    getInvertedSelection(nodeId: string): string[];
+    /** Get inverted selection with labels */
+    getInvertedSelectionWithLabels(nodeId: string): {
+        id: string;
+        label: string;
+    }[];
+    /** Find all paths between two nodes using DFS (with cycle prevention and depth limit) */
+    findAllPaths(startId: string, endId: string, maxDepth?: number): PathResult[];
+    /** Find the shortest path between two nodes using BFS */
+    findShortestPath(startId: string, endId: string): PathResult | null;
+    /** Find all paths connecting multiple nodes (pairwise) */
+    findAllPathsBetweenMultiple(nodeIds: string[]): PathResult[];
+    /** Check if two nodes are reachable from each other */
+    areConnected(startId: string, endId: string): boolean;
+    /** Get all edges connected to a set of nodes (both endpoints in the set) */
+    getEdgesForNodes(nodeIds: Set<string>): GraphEdge[];
+    /** Get all edges touching a node (as source or target) */
+    getEdgesOfNode(nodeId: string): GraphEdge[];
+    /** Get edges on specific paths (returns set of "source->target" keys) */
+    getEdgesOnPaths(paths: PathResult[]): Set<string>;
+    /** Extract a subgraph containing only the specified nodes and edges between them */
+    getSubgraph(nodeIds: string[]): SubgraphResult;
+    /** Get the neighborhood subgraph: the node + all its direct neighbors + connecting edges */
+    getNeighborhoodSubgraph(nodeId: string): SubgraphResult;
+    /** Get summary stats about the graph */
+    getStats(): GraphStats;
+    /** Get nodes sorted by degree (descending) */
+    getNodesByDegree(): {
+        id: string;
+        label: string;
+        degree: number;
+    }[];
+    /** Serialize a node list to CSV string */
+    static toCSV(nodes: {
+        id: string;
+        label: string;
+    }[]): string;
+    /** Serialize paths to CSV string */
+    static pathsToCSV(paths: PathResult[]): string;
+    /** Serialize a node list to JSON string */
+    static toJSON(nodes: {
+        id: string;
+        label: string;
+    }[]): string;
+    /** Serialize paths to JSON string */
+    static pathsToJSON(paths: PathResult[]): string;
+    /** Export the full graph data as JSON string */
+    toGraphJSON(): string;
+    isDirected(): boolean;
+    nodeCount(): number;
+    edgeCount(): number;
+}