Data Science & Analytics
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).
- Publisher / source
- ruvnet/ruflo (found on skills.sh, the CSV list)
- Upstream record
- ruvnet/ruflo
- Version
- Version 1
- Published
- Publication review
- Approved for publication
- Content fingerprint
5136e7f094b4e281661f1faa1600e49f52676a2c49b795ab2dc51633a25510cd