Compact adjacency matrix.
Adjacency Matrix
Compact adjacency matrix.
Adjacency matrix code bricks for JavaScript
A JavaScript package implementing the Adjacency Matrix data structure for efficient graph representation and operations.
Converts a DOT file to an adjacency matrix
State adjacency matrix in JS
Topological indexing for simplicial complexes
A very simple graph implementation for use in JS, using an adjacency matrix..
Javascript Matrix and Vector library for High Performance WebGL apps
This repository is a Svelte component library for applications that would like to visually represent different types of graphs. The visual component allows you to specify and adjacency matrix and it will display a randomized 9 node graph in a specified re
Matrix Client-Server SDK for Javascript
WebAssembly bindings of the matrix-sdk-crypto encryption library
Matrix manipulation and computation library
Visualize relationships or network flow with an aesthetically-pleasing circular layout.
Welcome to the [Node.js] binding for the Rust [`matrix-sdk-crypto`] library! This binding is part of the [`matrix-rust-sdk`] project, which is a library implementation of a [Matrix] client-server.
2d transformation matrix functions written in ES6 syntax. Tree shaking ready!
Canvas for Node.js with skia backend
Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs
Convert a list of edges to an adjacency list
matrix for scena
Search and Rewrite code at large scale using precise AST pattern
JSON grammar for tree-sitter
Multipurpose Javascript 3D graphic library
Allows storing adjacency matrices
Native implementation of Dijkstra algorithm for finding the shortest path between two vertices in a large, sparse graphs. Underlying algorithm is implemented in C using a priority queue. Edges are represented using linked lists rather than an adjacency matrix to reduce memory footprint when operating on very large graphs where the average number of edges between nodes is relatively small (e.g. < 1/10 the number of nodes). See https://en.wikipedia.org/wiki/Dijkstra's_algorithm for additional information.