@affectively/wasm-graph-algorithms
v1.0.1
Published
High-performance WebAssembly graph algorithms - cycle detection, DAG operations, path finding, topological sort.
Downloads
171
Maintainers
Readme
@affectively/wasm-graph-algorithms
High-performance WebAssembly graph algorithms written in Rust.
Features
- Cycle Detection - Detect cycles in directed graphs
- DAG Operations - Directed Acyclic Graph utilities
- Path Finding - Shortest path algorithms (Dijkstra, A*)
- Topological Sort - Order nodes by dependencies
Installation
npm install @affectively/wasm-graph-algorithmsQuick Start
import init, { detect_cycles, find_path, topological_sort } from '@affectively/wasm-graph-algorithms';
await init();
// Cycle detection
const hasCycle = detect_cycles(graph);
// Path finding
const path = find_path(graph, start, end);
// Topological sort
const sorted = topological_sort(dag);License
MIT License - see LICENSE for details.
Made with ️ by AFFECTIVELY
