weave-graph 0.2.40

Graph conflict detection and pattern matching for OSINT knowledge graphs
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
25
26
27
28
29
30

# weave-graph

Graph conflict-of-interest pattern detection for OSINT knowledge graphs.

Part of the [Weave](https://github.com/redberrythread/weave) workspace.

## Patterns

Six built-in conflict-of-interest patterns (COI-001 through COI-006) using three algorithms:

- **Cycle detection** -- directed simple cycles matching edge-type sequences (e.g. payment-appointment kickbacks)
- **Path detection** -- constrained DFS matching edge types and node labels (e.g. family appointments, payment influence chains)
- **Hub detection** -- Person-Organization pairs with concentrated influence edges exceeding a threshold

All algorithms operate on in-memory subgraphs with O(1) adjacency lookups. Detection completes in <50ms for subgraphs up to 10K nodes / 50K edges.

## Usage

```rust
use weave_graph::graph::{Subgraph, IndexedSubgraph};
use weave_graph::detect::{detect_conflicts, DetectOpts};

let subgraph = Subgraph { nodes: vec![/* ... */], edges: vec![/* ... */] };
let indexed = IndexedSubgraph::from_subgraph(&subgraph);
let results = detect_conflicts(&indexed, &DetectOpts::default());
```

## License

MIT