Shortest path functions for graphology.
Some JavaScript and TypeScript implementation of a graph data structure.
Features:- Insert and remove nodes.
- Connect and disconnect nodes.
- Algorithms for graph structures.
Dijkstra algorithm optimized with priority queue.