This library contains multiple low-level indexation structures used to optimize graph computations in other graphology libraries. This library is not meant to be used as such and this is why it is not thoroughly documented.

For now, here are the exposed indices:

An unweighted and weighted neighborhood index used to speed up computations requiring many successive BSTs in a graph.
A directed and undirected index used to track an evolving community structure when running the Louvain community detection algorithm.
An indexed view of a graph's connected components sorted by order.
A specialized stack/set that can be used to perform memory-efficient DFS traversals.
A specialized queue/set that can be used to perform memory-efficient BFS traversals.

Keywords

FAQs

What is graphology-indices?

Is graphology-indices popular?

Is graphology-indices well maintained?

Package last updated on 10 Jan 2022

Did you know?

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install