samyama-graph-algorithms 0.2.1

Graph algorithms (PageRank, WCC, BFS, Dijkstra) for Samyama Graph Database
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

# Samyama Graph Algorithms

This crate implements standard graph algorithms for the [Samyama Graph Database](https://github.com/samyama-ai/samyama-graph).

## Algorithms

- **PageRank**: Node centrality scoring.
- **Weakly Connected Components (WCC)**: Find disjoint subgraphs.
- **BFS**: Unweighted shortest path.
- **Dijkstra**: Weighted shortest path.

## Usage

These algorithms operate on a `GraphView`, which is a lightweight, read-only topology view of the graph.

```rust
use samyama_graph_algorithms::{GraphView, page_rank, PageRankConfig};

// Construct view (usually done by samyama-graph adapter)
// let view = ...; 

// Run PageRank
let scores = page_rank(&view, PageRankConfig::default());
```