github.com/a-mozeak/adigo
A Go implementation of the Adjacency Descriptive Integer Graph data structure. The data structure uses Integers to Describe the set of nodes Adjacent to a given node in a graph.
Graphs are used throughout computer science to store and relate data. A good example is a Social Graph.
Two of the most common ways to implement a graph are the Adjacency List and the Adjacency Matrix. Adjacency Lists are compact, but handling them often requires linear traversal of linked-lists. Adjacency Matrices are easy to reason about and parallelizable, but often take up far too much space.
The Adjacency Descriptive Integer is an attempt to represent a graph in a compactly, while still allowing for simple reasoning about node connections and parallel operations.
ADI Graphs are a more specific implementation of a bitset graph representation, aiming to exploit the speed of processing register-size operations on 8-, 16-, 32-, and 64- bit machines.
FAQs
Unknown package
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.
Research
Security News
Malicious npm package postcss-optimizer delivers BeaverTail malware, targeting developer systems; similarities to past campaigns suggest a North Korean connection.
Security News
CISA's KEV data is now on GitHub, offering easier access, API integration, commit history tracking, and automated updates for security teams and researchers.
Security News
Opengrep forks Semgrep to preserve open source SAST in response to controversial licensing changes.
