Data Science & Analytics
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.
- 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
ad157b9805a22c9583bde229b3a064c1081371cbb5f71ae5f4abcb80921a11f0