This project is part of the @thi.ng/umbrella monorepo.

• About
  • Graph implementations
  • Traversals
• Status
• Related packages
• Installation
• Dependencies
• Usage examples
• API
• Authors
• License

Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs.

The following types all implement the IGraph interface and support both directed & undirected graphs:

• AdjacencyBitMatrix (bit matrix based)
• AdjacencyMatrix (sparse matrix based)
• AdjacencyList

• Breadth-First Search
• Depth-First Search
• Floyd-Warshall (global shortest paths search)
• Minimum Spanning Tree

STABLE - used in production

Search or submit any issues for this package

• @thi.ng/dgraph - Type-agnostic directed acyclic graph (DAG) & graph operations

yarn add @thi.ng/adjacency

ES module import:

<script type="module" src="https://cdn.skypack.dev/@thi.ng/adjacency"></script>

Skypack documentation

For Node.js REPL:

const adjacency = await import("@thi.ng/adjacency");

Package sizes (brotli'd, pre-treeshake): ESM: 2.55 KB

• @thi.ng/api
• @thi.ng/arrays
• @thi.ng/bitfield
• @thi.ng/dcons
• @thi.ng/errors
• @thi.ng/sparse

Several demos in this repo's /examples directory are using this package.

A selection:

Screenshot	Description	Live demo	Source
	Poisson-disk shape-aware sampling, Voronoi & Minimum Spanning Tree visualization	Demo	Source

Generated API docs

TODO

• Karsten Schmidt

If this project contributes to an academic publication, please cite it as:

@misc{thing-adjacency,
  title = "@thi.ng/adjacency",
  author = "Karsten Schmidt",
  note = "https://thi.ng/adjacency",
  year = 2018
}

© 2018 - 2023 Karsten Schmidt // Apache License 2.0