starlight-graph

Graph algorithms and data structures for Starlight.

Installation

npm install starlight-graph

Features

• Graph creation (directed / undirected)
• BFS (Breadth-First Search)
• DFS (Depth-First Search)
• Dijkstra shortest path
• Path reconstruction

Usage

import graph from "starlight-graph";

const g = graph.createGraph();

graph.addEdge(g, "A", "B", 1);
graph.addEdge(g, "A", "C", 2);
graph.addEdge(g, "B", "D", 3);
graph.addEdge(g, "C", "D", 1);

console.log(graph.bfs(g, "A"));
// [ 'A', 'B', 'C', 'D' ]

console.log(graph.dfs(g, "A"));

console.log(graph.dijkstra(g, "A"));

console.log(graph.shortestPath(g, "A", "D"));
// [ 'A', 'C', 'D' ]

API

createGraph(directed = false)

Create a graph.

addNode(graph, node)

Add a node.

addEdge(graph, from, to, weight)

Add an edge.

bfs(graph, start)

Breadth-first traversal.

dfs(graph, start)

Depth-first traversal.

dijkstra(graph, start)

Shortest distances from start.

shortestPath(graph, start, end)

Returns shortest path array.

License

MIT