Graph Mincut

Find the weakest boundary in a dependency or knowledge graph with an exact minimum cut (@ruvector/mincut-wasm via ruvector). Use when the user asks where to split a module, which files are loosely coupled, what cluster a node belongs to, or how to partition work between agents. Skip for shortest paths or simple neighbour lookups (use agentdb_graph-query k-hop).

ruvnet Updated 104k repo stars
Ruflo animated neon sign

File contents

ruvnet/ruflo commit 6f50b12cd7

Frequently asked questions

npx get-skill add ruvnet/graph-mincut