@dagrejs/graphlib

Creating a Graph

This feature allows you to create a new graph, add nodes, and add edges between nodes. The code sample demonstrates creating a graph, adding two nodes 'a' and 'b', and creating an edge from 'a' to 'b'.

const graphlib = require('@dagrejs/graphlib');
const Graph = graphlib.Graph;
const g = new Graph();
g.setNode('a');
g.setNode('b');
g.setEdge('a', 'b');
console.log(g.nodes()); // ['a', 'b']
console.log(g.edges()); // [{ v: 'a', w: 'b' }]

Graph Traversal

This feature allows you to perform depth-first search (DFS) traversal on the graph. The code sample demonstrates creating a graph with three nodes and two edges, and then performing DFS starting from node 'a'.

const graphlib = require('@dagrejs/graphlib');
const Graph = graphlib.Graph;
const g = new Graph();
g.setNode('a');
g.setNode('b');
g.setNode('c');
g.setEdge('a', 'b');
g.setEdge('b', 'c');
const dfs = graphlib.alg.dfs(g, ['a']);
console.log(dfs); // [{ v: 'a' }, { v: 'b' }, { v: 'c' }]

Finding Shortest Path

This feature allows you to find the shortest path in the graph using Dijkstra's algorithm. The code sample demonstrates creating a graph with three nodes and three weighted edges, and then finding the shortest path from node 'a' to all other nodes.

const graphlib = require('@dagrejs/graphlib');
const Graph = graphlib.Graph;
const g = new Graph();
g.setNode('a');
g.setNode('b');
g.setNode('c');
g.setEdge('a', 'b', { weight: 1 });
g.setEdge('b', 'c', { weight: 2 });
g.setEdge('a', 'c', { weight: 4 });
const dijkstra = graphlib.alg.dijkstra(g, 'a');
console.log(dijkstra); // { a: { distance: 0 }, b: { distance: 1 }, c: { distance: 3 } }