Search results
5 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
Package implements data structures and algorithms for processing various types of graphs
- graph
- weighted graph
- digraph
- directed graph
- connected components
- strongly connected components
- min cut
- max flow
- dijkstra
- bellman-ford
- minimum spanning tree
- depth first search
- breadth first search
- directed cycles
- View more
published version 1.0.18, 7 years ago9 dependents licensed under $MIT
166,666
Data structure and graph processing library written in modern JavaScript
- data structures
- javascript
- graph
- undirected graph
- directed graph
- weighted graph
- breadth first search
- BFS
- depth first search
- DFS
- dijkstra
- shortest path
- prim
- minimum spanning tree
- View more
published version 1.0.0, 5 years ago1 dependents licensed under $MIT
159
Given a distance array, computes the Minimum Spanning Tree using Kruskal's algorithm.
published version 0.0.4, 12 years ago1 dependents licensed under $BSD
24
A simple implementation of Kruskal's algorithm for finding the miminum spanning tree of a graph.
published version 0.0.5, 7 years ago1 dependents licensed under $GPLv3
21
A simple implementation of a Euclidean Minimum Spanning Tree algorithm
published version 0.0.7, 7 years ago0 dependents licensed under $GPLv3
19