Graph Mincut

Exact minimum cut over code and knowledge graphs (@ruvector/mincut-wasm via ruvector) to find the weakest boundaries. Use when: deciding where to split a module, finding loosely coupled files, finding a node's cluster, partitioning work between agents. Skip when: shortest paths or plain neighbour lookups.

ruvnet Updated 104k repo stars
Ruflo animated neon sign

File contents

ruvnet/ruflo commit 912058fb84

Frequently asked questions

npx get-skill add ruvnet/graph-mincut-2