Unobtanium Graph Algorithms

Documentation | Codeberg

This rust crate implements graph ranking algorithms for the unobtanium search engine.

Currently implemented Algorithms are:

• PageRank (needs fixes, only works for undirected graphs right now)
• TextRank

Overview

At the core of this crate is the Graph data structure, which can be populated with arbitrary data (Must implement Hash, Eq and Clone) that represents nodes.

On top of this Graph functions like populate_for_textrank() and run_pagerank() can prepare the graph and run different algorithms on it.

Custom graph configurations can be realized by populating the graph inside a callback to its modify method. The callback is to make sure that node ids inside the graph stay opaque and can't be confused with the ids of another graph structure. (This is called Data Branding)

License

The Unobtanium Graph Algorithms crate is licensed as LGPL-3.0-only.

The project aims to be compliant with version 3.3 of the reuse specification.