@graphty/algorithms 2.1.2 → 2.2.0

package/dist/src/indexed/markov.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"markov.js","sourceRoot":"","sources":["../../../src/indexed/markov.ts"],"names":[],"mappings":"AAEA,OAAO,EAAoB,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAqC/D;;;GAGG;AACH,SAAS,gBAAgB,CAAC,CAAM;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;YACpB,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,QAAQ,CAAC,CAAM,EAAE,CAAM,EAAE,GAAiB,EAAE,IAAgB;IACjE,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBAChB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACZ,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;gBACD,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAC7B,CAAC;QACL,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC9E,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CAAC,CAAM,EAAE,SAAiB,EAAE,SAAiB;IACjE,MAAM,OAAO,GAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;IAC/F,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;QACD,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAC/E,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACtB,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,CAAM,EAAE,CAAM,EAAE,SAAiB;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACtB,IAAI,IAAY,CAAC;YACjB,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7C,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;iBAAM,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACJ,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC;gBAC7B,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,gBAAgB,CAAC,CAAgB,EAAE,OAA6B,EAAE,SAAkB;IACzF,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,iGAAiG;IACjG,4EAA4E;IAC5E,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IAC3B,CAAC;IACD,IAAI,SAAS,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACjB,CAAC;IACL,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,OAAgB,EAAQ,EAAE;QACpE,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACpC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACJ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACjB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;IACL,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,4FAA4F;QAC5F,sEAAsE;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5C,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAC9B,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC,eAAe,CAAC,wDAAwD,CAAC,CAAC;YAC3G,CAAC;YACD,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,SAAS,EAAE,CAAC;YACZ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IACD,oFAAoF;IACpF,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAChC,CAAC;IACD,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACrF,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpB,OAAO,CAAC,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAgB,EAAE,UAAyB,EAAE;IAC1E,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;IACzC,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,GAAG,CAAC;IACnD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,IAAI,CAAC;IAC1D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,IAAI,UAAU,CAAC,mDAAmD,SAAS,EAAE,CAAC,CAAC;IACzF,CAAC;IACD,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;QAC7C,MAAM,IAAI,UAAU,CAAC,6CAA6C,SAAS,EAAE,CAAC,CAAC;IACnF,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,UAAU,CAAC,qDAAqD,aAAa,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC;QAChD,MAAM,IAAI,UAAU,CAAC,qDAAqD,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;IAC7C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QACpD,MAAM,IAAI,UAAU,CAAC,eAAe,OAAO,CAAC,MAAM,8BAA8B,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;IACvG,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC;IAChE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,SAAS,GAAG,CAAC,KAAK,CAAC,CAAC;IACxB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,CAAC,SAAS,IAAI,UAAU,GAAG,aAAa,EAAE,CAAC;QAC9C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAChD,CAAC;QACD,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,CAAC,CAAC;QACpE,UAAU,EAAE,CAAC;QACb,SAAS,GAAG,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAChD,CAAC,GAAG,IAAI,CAAC;IACb,CAAC;IAED,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,mFAAmF;IACnF,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;gBAClB,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChB,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;IACL,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACT,IAAI,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACtB,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC;gBAC9B,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACnC,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;IACL,CAAC;IACD,IAAI,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;QACxB,CAAC;IACL,CAAC;IACD,OAAO,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,UAAU,EAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;AAC7G,CAAC"}

package/dist/src/indexed/matching.d.ts

@@ -0,0 +1,53 @@
+import { type GraphSnapshot, type NodeMask, type U32 } from "@graphty/graph-format";
+/** Options of {@link maximumBipartiteMatching} and {@link greedyBipartiteMatching}. @public */
+export interface BipartiteMatchingOptions {
+    /**
+     * The left side. Given together with `right`, the two sides are used as they are and the graph
+     * is not tested for bipartiteness; a node on neither side is never matched. When either is
+     * missing both come from `isBipartite`: its first side is the left one.
+     */
+    readonly left?: NodeMask | undefined;
+    /** The right side; see `left`. */
+    readonly right?: NodeMask | undefined;
+    /**
+     * Which arcs of a directed snapshot join a left node to a right one. "both" (default) ignores
+     * direction, as a matching does. "out" follows out-arcs of left nodes only, as the legacy
+     * functions do, and is also passed to `isBipartite` when the sides are inferred. Ignored on an
+     * undirected snapshot.
+     */
+    readonly arcs?: "both" | "out" | undefined;
+}
+/** Result of the index-based bipartite matchings. @public */
+export interface BipartiteMatchingResult {
+    /**
+     * The right partner of every matched left node; INVALID_INDEX for an unmatched left node and
+     * for every node that is not on the left side.
+     */
+    readonly matching: U32;
+    /** The number of matched pairs. */
+    readonly size: number;
+}
+/**
+ * Maximum matching of a bipartite graph by augmenting paths (Kuhn's algorithm, O(V E)): every left
+ * node in index order searches depth-first, iteratively, for an augmenting path. Parallel arcs and
+ * arc direction (by default) make no difference to the matching size.
+ * @param s - The snapshot
+ * @param options - The two sides, and which arcs to follow on a directed snapshot
+ * @returns The partner of every matched left node and the number of pairs
+ * @throws Error when the sides are inferred and the graph is not bipartite
+ * @public
+ */
+export declare function maximumBipartiteMatching(s: GraphSnapshot, options?: BipartiteMatchingOptions): BipartiteMatchingResult;
+/**
+ * Greedy maximal bipartite matching: every left node in index order takes its first unmatched
+ * right neighbour in row order (the lowest index; out-arcs before in-arcs). The size depends on
+ * those orders, so it can differ from the legacy function, which visits left nodes in its
+ * colouring BFS order and neighbours in insertion order; it is at least half the maximum.
+ * @param s - The snapshot
+ * @param options - The two sides, and which arcs to follow on a directed snapshot
+ * @returns The partner of every matched left node and the number of pairs
+ * @throws Error when the sides are inferred and the graph is not bipartite
+ * @public
+ */
+export declare function greedyBipartiteMatching(s: GraphSnapshot, options?: BipartiteMatchingOptions): BipartiteMatchingResult;
+//# sourceMappingURL=matching.d.ts.map

package/dist/src/indexed/matching.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matching.d.ts","sourceRoot":"","sources":["../../../src/indexed/matching.ts"],"names":[],"mappings":"AAAA,OAAO,EAEH,KAAK,aAAa,EAIlB,KAAK,QAAQ,EACb,KAAK,GAAG,EACX,MAAM,uBAAuB,CAAC;AAI/B,+FAA+F;AAC/F,MAAM,WAAW,wBAAwB;IACrC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;IACrC,kCAAkC;IAClC,QAAQ,CAAC,KAAK,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;IACtC;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,KAAK,GAAG,SAAS,CAAC;CAC9C;AAED,6DAA6D;AAC7D,MAAM,WAAW,uBAAuB;IACpC;;;OAGG;IACH,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC;IACvB,mCAAmC;IACnC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACzB;AA6BD;;;;;;;;;GASG;AACH,wBAAgB,wBAAwB,CACpC,CAAC,EAAE,aAAa,EAChB,OAAO,GAAE,wBAA6B,GACvC,uBAAuB,CAqEzB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,uBAAuB,CACnC,CAAC,EAAE,aAAa,EAChB,OAAO,GAAE,wBAA6B,GACvC,uBAAuB,CAwBzB"}

package/dist/src/indexed/matching.js

@@ -0,0 +1,139 @@
+import { INVALID_INDEX, makeMask, maskTest, } from "@graphty/graph-format";
+import { isBipartite } from "./bipartite.js";
+function resolveSides(s, options) {
+    const views = s.directed && options.arcs !== "out" ? [s, s.reverse()] : [s];
+    if (options.left !== undefined && options.right !== undefined) {
+        return { left: options.left, right: options.right, views };
+    }
+    const { sides } = isBipartite(s, { arcs: options.arcs });
+    if (sides === null) {
+        throw new Error("Graph is not bipartite");
+    }
+    const left = makeMask(s.nodeCount);
+    for (let w = 0; w < left.length; w++) {
+        left[w] = ~sides[w];
+    }
+    // Clear the padding bits past nodeCount so the mask stays well formed.
+    const tail = s.nodeCount % 32;
+    if (tail !== 0) {
+        left[left.length - 1] &= (1 << tail) - 1;
+    }
+    return { left, right: sides, views };
+}
+/**
+ * Maximum matching of a bipartite graph by augmenting paths (Kuhn's algorithm, O(V E)): every left
+ * node in index order searches depth-first, iteratively, for an augmenting path. Parallel arcs and
+ * arc direction (by default) make no difference to the matching size.
+ * @param s - The snapshot
+ * @param options - The two sides, and which arcs to follow on a directed snapshot
+ * @returns The partner of every matched left node and the number of pairs
+ * @throws Error when the sides are inferred and the graph is not bipartite
+ * @public
+ */
+export function maximumBipartiteMatching(s, options = {}) {
+    // ponytail: Kuhn is O(V E) like the legacy function; Hopcroft-Karp (O(sqrt(V) E)) if a caller
+    // needs large graphs with long augmenting paths.
+    const { left, right, views } = resolveSides(s, options);
+    const { nodeCount } = s;
+    const matching = new Uint32Array(nodeCount).fill(INVALID_INDEX);
+    const mateOfRight = new Uint32Array(nodeCount).fill(INVALID_INDEX);
+    const seen = new Uint32Array(nodeCount);
+    // The DFS stack of left nodes; view and arc cursors per stacked node; the right node taken to
+    // descend from each stacked node.
+    const stack = new Uint32Array(nodeCount);
+    const viewAt = new Uint8Array(nodeCount);
+    const arcAt = new Uint32Array(nodeCount);
+    const via = new Uint32Array(nodeCount);
+    let size = 0;
+    for (let root = 0; root < nodeCount; root++) {
+        if (!maskTest(left, root)) {
+            continue;
+        }
+        const stamp = root + 1;
+        let top = 0;
+        stack[top++] = root;
+        viewAt[root] = 0;
+        arcAt[root] = 0;
+        let free = INVALID_INDEX;
+        search: while (top > 0) {
+            const x = stack[top - 1];
+            for (; viewAt[x] < views.length; viewAt[x]++) {
+                const { rowPtr, colIdx } = views[viewAt[x]];
+                const end = rowPtr[x + 1];
+                // A cursor of 0 means "not started in this view".
+                if (arcAt[x] < rowPtr[x]) {
+                    arcAt[x] = rowPtr[x];
+                }
+                while (arcAt[x] < end) {
+                    const v = colIdx[arcAt[x]++];
+                    if (seen[v] === stamp || !maskTest(right, v)) {
+                        continue;
+                    }
+                    seen[v] = stamp;
+                    const next = mateOfRight[v];
+                    if (next === INVALID_INDEX) {
+                        free = v;
+                        break search;
+                    }
+                    via[x] = v;
+                    stack[top++] = next;
+                    viewAt[next] = 0;
+                    arcAt[next] = 0;
+                    continue search;
+                }
+                arcAt[x] = 0;
+            }
+            top--;
+        }
+        if (free === INVALID_INDEX) {
+            continue;
+        }
+        // Flip the path: the top node takes the free right node, every node below takes the right
+        // node it descended through.
+        for (let k = top - 1; k >= 0; k--) {
+            const x = stack[k];
+            const v = k === top - 1 ? free : via[x];
+            matching[x] = v;
+            mateOfRight[v] = x;
+        }
+        size++;
+    }
+    return { matching, size };
+}
+/**
+ * Greedy maximal bipartite matching: every left node in index order takes its first unmatched
+ * right neighbour in row order (the lowest index; out-arcs before in-arcs). The size depends on
+ * those orders, so it can differ from the legacy function, which visits left nodes in its
+ * colouring BFS order and neighbours in insertion order; it is at least half the maximum.
+ * @param s - The snapshot
+ * @param options - The two sides, and which arcs to follow on a directed snapshot
+ * @returns The partner of every matched left node and the number of pairs
+ * @throws Error when the sides are inferred and the graph is not bipartite
+ * @public
+ */
+export function greedyBipartiteMatching(s, options = {}) {
+    const { left, right, views } = resolveSides(s, options);
+    const { nodeCount } = s;
+    const matching = new Uint32Array(nodeCount).fill(INVALID_INDEX);
+    const taken = new Uint8Array(nodeCount);
+    let size = 0;
+    for (let u = 0; u < nodeCount; u++) {
+        if (!maskTest(left, u)) {
+            continue;
+        }
+        pick: for (const { rowPtr, colIdx } of views) {
+            const end = rowPtr[u + 1];
+            for (let a = rowPtr[u]; a < end; a++) {
+                const v = colIdx[a];
+                if (taken[v] === 0 && maskTest(right, v)) {
+                    taken[v] = 1;
+                    matching[u] = v;
+                    size++;
+                    break pick;
+                }
+            }
+        }
+    }
+    return { matching, size };
+}
+//# sourceMappingURL=matching.js.map

package/dist/src/indexed/matching.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matching.js","sourceRoot":"","sources":["../../../src/indexed/matching.ts"],"names":[],"mappings":"AAAA,OAAO,EAGH,aAAa,EACb,QAAQ,EACR,QAAQ,GAGX,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAsC7C,SAAS,YAAY,CAAC,CAAgB,EAAE,OAAiC;IACrE,MAAM,KAAK,GAAoB,CAAC,CAAC,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7F,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC5D,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC;IAC/D,CAAC;IACD,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACzD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,uEAAuE;IACvE,MAAM,IAAI,GAAG,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC;IAC9B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CACpC,CAAgB,EAChB,UAAoC,EAAE;IAEtC,8FAA8F;IAC9F,iDAAiD;IACjD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACxD,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;IACxB,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAChE,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACxC,8FAA8F;IAC9F,kCAAkC;IAClC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACxB,SAAS;QACb,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,IAAI,IAAI,GAAG,aAAa,CAAC;QACzB,MAAM,EAAE,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACzB,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1B,kDAAkD;gBAClD,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,CAAC;gBACD,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;oBACpB,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBAC7B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;wBAC3C,SAAS;oBACb,CAAC;oBACD,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBAChB,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,IAAI,KAAK,aAAa,EAAE,CAAC;wBACzB,IAAI,GAAG,CAAC,CAAC;wBACT,MAAM,MAAM,CAAC;oBACjB,CAAC;oBACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACX,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;oBACpB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAChB,SAAS,MAAM,CAAC;gBACpB,CAAC;gBACD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;YACD,GAAG,EAAE,CAAC;QACV,CAAC;QACD,IAAI,IAAI,KAAK,aAAa,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QACD,0FAA0F;QAC1F,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAChB,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QACD,IAAI,EAAE,CAAC;IACX,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,uBAAuB,CACnC,CAAgB,EAChB,UAAoC,EAAE;IAEtC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACxD,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;IACxB,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAChE,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACrB,SAAS;QACb,CAAC;QACD,IAAI,EAAE,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;oBACvC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACb,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAChB,IAAI,EAAE,CAAC;oBACP,MAAM,IAAI,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC9B,CAAC"}

package/dist/src/indexed/min-cut.d.ts

@@ -0,0 +1,48 @@
+import { type GraphSnapshot, type NumericVector } from "@graphty/graph-format";
+import { type MinCutResult } from "./flow.js";
+/** Options of {@link stoerWagner}. @public */
+export interface StoerWagnerOptions {
+    /** Per-arc weight override, arcCount long; without it the snapshot's weights (1 when unweighted). */
+    readonly weights?: NumericVector | undefined;
+}
+/** Options of {@link kargerMinCut}. @public */
+export interface KargerOptions {
+    /** Independent contraction trials; the lightest cut found wins. Default 100. */
+    readonly iterations?: number | undefined;
+    /** Seed of the edge orders; one seed gives one result, bit for bit. Default 42. */
+    readonly randomSeed?: number | undefined;
+    /** Per-arc weight override, arcCount long; without it the snapshot's weights (1 when unweighted). */
+    readonly weights?: NumericVector | undefined;
+}
+/**
+ * Global minimum cut by Stoer-Wagner, reading every edge as undirected (a directed snapshot's arcs
+ * count in both directions, so two opposite arcs between one pair add up).
+ *
+ * No graph is contracted (graph-format design 14.2): a representative array and member lists
+ * merge the last two nodes of each phase, and each phase's maximum-adjacency order accumulates the
+ * weights of the ORIGINAL arcs of the merged members in an {@link IndexedMaxHeap}. A phase starts
+ * from the lowest-index remaining representative and takes equal keys lowest index first, and the
+ * first phase with the lightest cut wins, which is the order the legacy implementation uses.
+ * O(n (m + n) log n).
+ * @param s - The snapshot
+ * @param options - The weight override
+ * @returns The cut value, the side holding the last node of the winning phase, and the cut edges;
+ *   with fewer than two nodes the value is 0 and every node is on `side`
+ * @public
+ */
+export declare function stoerWagner(s: GraphSnapshot, options?: StoerWagnerOptions): MinCutResult;
+/**
+ * Global minimum cut by Karger's randomised contraction, reading every edge as undirected. Each
+ * trial unions the endpoints of the edges in a seeded random order (an {@link IntUnionFind}, no
+ * graph is contracted) until two groups remain, so every edge is equally likely to be contracted
+ * next whatever its weight; the trial's cut is the weight of the edges between the two groups.
+ * A graph with more than two components gives a cut of 0 with node 0's component on `side`.
+ * O(m alpha(n)) per trial.
+ * @param s - The snapshot
+ * @param options - Trials, seed and weight override
+ * @returns The lightest cut found; with fewer than two nodes the value is 0 and `side` is empty
+ * @throws RangeError when `randomSeed` is not an integer or `iterations` is not a positive integer
+ * @public
+ */
+export declare function kargerMinCut(s: GraphSnapshot, options?: KargerOptions): MinCutResult;
+//# sourceMappingURL=min-cut.d.ts.map

package/dist/src/indexed/min-cut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-cut.d.ts","sourceRoot":"","sources":["../../../src/indexed/min-cut.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,KAAK,aAAa,EAKlB,KAAK,aAAa,EACrB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAiC,KAAK,YAAY,EAAE,MAAM,WAAW,CAAC;AAK7E,8CAA8C;AAC9C,MAAM,WAAW,kBAAkB;IAC/B,qGAAqG;IACrG,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED,+CAA+C;AAC/C,MAAM,WAAW,aAAa;IAC1B,gFAAgF;IAChF,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,mFAAmF;IACnF,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,qGAAqG;IACrG,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,kBAAuB,GAAG,YAAY,CAuF5F;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,aAAkB,GAAG,YAAY,CAoDxF"}

package/dist/src/indexed/min-cut.js

@@ -0,0 +1,175 @@
+import { INVALID_INDEX, makeMask, maskSet, } from "@graphty/graph-format";
+import { crossingEdges, edgeCapacities } from "./flow.js";
+import { mulberry32 } from "./label-propagation.js";
+import { IndexedMaxHeap } from "./structures/max-heap.js";
+import { IntUnionFind } from "./structures/union-find.js";
+/**
+ * Global minimum cut by Stoer-Wagner, reading every edge as undirected (a directed snapshot's arcs
+ * count in both directions, so two opposite arcs between one pair add up).
+ *
+ * No graph is contracted (graph-format design 14.2): a representative array and member lists
+ * merge the last two nodes of each phase, and each phase's maximum-adjacency order accumulates the
+ * weights of the ORIGINAL arcs of the merged members in an {@link IndexedMaxHeap}. A phase starts
+ * from the lowest-index remaining representative and takes equal keys lowest index first, and the
+ * first phase with the lightest cut wins, which is the order the legacy implementation uses.
+ * O(n (m + n) log n).
+ * @param s - The snapshot
+ * @param options - The weight override
+ * @returns The cut value, the side holding the last node of the winning phase, and the cut edges;
+ *   with fewer than two nodes the value is 0 and every node is on `side`
+ * @public
+ */
+export function stoerWagner(s, options = {}) {
+    const n = s.nodeCount;
+    const capacity = edgeCapacities(s, options.weights);
+    if (n < 2) {
+        return { cutValue: 0, side: makeMask(n, true), cutEdges: new Uint32Array(0) };
+    }
+    // Incident (neighbour, edge) pairs per node, both directions of every edge.
+    const { src, dst } = s.edgeList();
+    const offset = new Uint32Array(n + 1);
+    for (let e = 0; e < s.edgeCount; e++) {
+        offset[src[e] + 1]++;
+        offset[dst[e] + 1]++;
+    }
+    for (let i = 0; i < n; i++) {
+        offset[i + 1] += offset[i];
+    }
+    const fill = offset.slice(0, n);
+    const neighbour = new Uint32Array(offset[n]);
+    const weight = new Float64Array(offset[n]);
+    for (let e = 0; e < s.edgeCount; e++) {
+        neighbour[fill[src[e]]] = dst[e];
+        weight[fill[src[e]]++] = capacity[e];
+        neighbour[fill[dst[e]]] = src[e];
+        weight[fill[dst[e]]++] = capacity[e];
+    }
+    const rep = new Uint32Array(n);
+    const next = new Uint32Array(n).fill(INVALID_INDEX); // member lists, one per representative
+    const tail = new Uint32Array(n);
+    for (let i = 0; i < n; i++) {
+        rep[i] = i;
+        tail[i] = i;
+    }
+    const connection = new Float64Array(n);
+    const added = new Uint8Array(n);
+    const heap = new IndexedMaxHeap(n);
+    let best = Infinity;
+    let bestSide = makeMask(n);
+    for (let active = n; active > 1; active--) {
+        let start = INVALID_INDEX;
+        for (let i = 0; i < n; i++) {
+            if (rep[i] !== i) {
+                continue;
+            }
+            added[i] = 0;
+            connection[i] = 0;
+            if (start === INVALID_INDEX) {
+                start = i;
+            }
+            else {
+                heap.push(i, 0);
+            }
+        }
+        let prev = INVALID_INDEX;
+        let last = start;
+        for (;;) {
+            added[last] = 1;
+            for (let m = last; m !== INVALID_INDEX; m = next[m]) {
+                for (let k = offset[m]; k < offset[m + 1]; k++) {
+                    const x = rep[neighbour[k]];
+                    if (added[x] === 0) {
+                        connection[x] += weight[k];
+                        heap.pushOrIncrease(x, connection[x]);
+                    }
+                }
+            }
+            if (heap.isEmpty()) {
+                break;
+            }
+            prev = last;
+            last = heap.pop();
+        }
+        if (connection[last] < best) {
+            best = connection[last];
+            bestSide = makeMask(n);
+            for (let m = last; m !== INVALID_INDEX; m = next[m]) {
+                maskSet(bestSide, m, true);
+            }
+        }
+        // Merge the last node of the phase into the one before it.
+        for (let m = last; m !== INVALID_INDEX; m = next[m]) {
+            rep[m] = prev;
+        }
+        next[tail[prev]] = last;
+        tail[prev] = tail[last];
+    }
+    return { cutValue: best, side: bestSide, cutEdges: crossingEdges(s, bestSide, false, capacity, false) };
+}
+/**
+ * Global minimum cut by Karger's randomised contraction, reading every edge as undirected. Each
+ * trial unions the endpoints of the edges in a seeded random order (an {@link IntUnionFind}, no
+ * graph is contracted) until two groups remain, so every edge is equally likely to be contracted
+ * next whatever its weight; the trial's cut is the weight of the edges between the two groups.
+ * A graph with more than two components gives a cut of 0 with node 0's component on `side`.
+ * O(m alpha(n)) per trial.
+ * @param s - The snapshot
+ * @param options - Trials, seed and weight override
+ * @returns The lightest cut found; with fewer than two nodes the value is 0 and `side` is empty
+ * @throws RangeError when `randomSeed` is not an integer or `iterations` is not a positive integer
+ * @public
+ */
+export function kargerMinCut(s, options = {}) {
+    const iterations = options.iterations ?? 100;
+    const randomSeed = options.randomSeed ?? 42;
+    if (!Number.isInteger(iterations) || iterations < 1) {
+        throw new RangeError(`iterations must be a positive integer, got ${iterations}`);
+    }
+    if (!Number.isInteger(randomSeed)) {
+        throw new RangeError(`randomSeed must be a finite integer, got ${randomSeed}`);
+    }
+    const n = s.nodeCount;
+    const capacity = edgeCapacities(s, options.weights);
+    if (n < 2) {
+        return { cutValue: 0, side: makeMask(n), cutEdges: new Uint32Array(0) };
+    }
+    const { src, dst } = s.edgeList();
+    const rand = mulberry32(randomSeed);
+    const order = new Uint32Array(s.edgeCount);
+    let best = Infinity;
+    let bestSide = makeMask(n);
+    for (let trial = 0; trial < iterations; trial++) {
+        for (let e = 0; e < order.length; e++) {
+            order[e] = e;
+        }
+        for (let i = order.length - 1; i > 0; i--) {
+            const j = Math.floor(rand() * (i + 1));
+            const t = order[i];
+            order[i] = order[j];
+            order[j] = t;
+        }
+        const uf = new IntUnionFind(n);
+        let groups = n;
+        for (let i = 0; i < order.length && groups > 2; i++) {
+            if (uf.union(src[order[i]], dst[order[i]])) {
+                groups--;
+            }
+        }
+        const root = uf.find(0);
+        let cut = 0;
+        for (let e = 0; e < s.edgeCount; e++) {
+            if ((uf.find(src[e]) === root) !== (uf.find(dst[e]) === root)) {
+                cut += capacity[e];
+            }
+        }
+        if (cut < best) {
+            best = cut;
+            bestSide = makeMask(n);
+            for (let v = 0; v < n; v++) {
+                maskSet(bestSide, v, uf.find(v) === root);
+            }
+        }
+    }
+    return { cutValue: best, side: bestSide, cutEdges: crossingEdges(s, bestSide, false, capacity, false) };
+}
+//# sourceMappingURL=min-cut.js.map

package/dist/src/indexed/min-cut.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-cut.js","sourceRoot":"","sources":["../../../src/indexed/min-cut.ts"],"names":[],"mappings":"AAAA,OAAO,EAEH,aAAa,EACb,QAAQ,EACR,OAAO,GAGV,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,aAAa,EAAE,cAAc,EAAqB,MAAM,WAAW,CAAC;AAC7E,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAkB1D;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,WAAW,CAAC,CAAgB,EAAE,UAA8B,EAAE;IAC1E,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IACpD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IAClF,CAAC;IACD,4EAA4E;IAC5E,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;IAClC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IACzB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,uCAAuC;IAC5F,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,QAAQ,GAAa,QAAQ,CAAC,CAAC,CAAC,CAAC;IAErC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,KAAK,GAAG,aAAa,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACf,SAAS;YACb,CAAC;YACD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACb,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK,KAAK,aAAa,EAAE,CAAC;gBAC1B,KAAK,GAAG,CAAC,CAAC;YACd,CAAC;iBAAM,CAAC;gBACJ,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,CAAC;QACL,CAAC;QACD,IAAI,IAAI,GAAG,aAAa,CAAC;QACzB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,SAAS,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,aAAa,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClD,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7C,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBACjB,UAAU,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;wBAC3B,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1C,CAAC;gBACL,CAAC;YACL,CAAC;YACD,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;gBACjB,MAAM;YACV,CAAC;YACD,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,CAAC;QACD,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;YAC1B,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YACxB,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,aAAa,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClD,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QACD,2DAA2D;QAC3D,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,aAAa,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAClD,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;AAC5G,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CAAC,CAAgB,EAAE,UAAyB,EAAE;IACtE,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;IAC7C,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,UAAU,CAAC,8CAA8C,UAAU,EAAE,CAAC,CAAC;IACrF,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,UAAU,CAAC,4CAA4C,UAAU,EAAE,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IACpD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5E,CAAC;IACD,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,QAAQ,GAAa,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzC,MAAM,EAAE,CAAC;YACb,CAAC;QACL,CAAC;QACD,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;gBAC5D,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;QACL,CAAC;QACD,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;YACb,IAAI,GAAG,GAAG,CAAC;YACX,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAC9C,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;AAC5G,CAAC"}

package/dist/src/indexed/modularity.d.ts

@@ -0,0 +1,34 @@
+import { type AdjacencyView, type NumericVector, type U32 } from "@graphty/graph-format";
+/** Options of the index-based modularity. @public */
+export interface ModularityOptions {
+    /** Resolution gamma: above 1 favours smaller communities; default 1. */
+    readonly resolution?: number | undefined;
+    /** Per-arc weight override, arcCount long -- the facade passes `expandEdges(s, shadow.data)`. */
+    readonly weights?: NumericVector | undefined;
+}
+/**
+ * Newman's modularity of a partition: `sum_c in_c / 2m - gamma * (tot_c / 2m)^2`, where `2m` is
+ * twice the total edge weight, `in_c` counts every edge inside community c twice and `tot_c` sums
+ * its nodes' weighted degrees. Degrees follow graph-format's `weightedDegree()` convention -- a
+ * self-loop counts twice -- so `sum(tot_c) === 2m`. On a directed snapshot the direction is
+ * ignored: every arc counts as an undirected edge, and a node's degree is its in-weight plus its
+ * out-weight.
+ *
+ * On an undirected snapshot without self-loops this equals the legacy `calculateModularity`. On
+ * a directed snapshot or one with self-loops the two differ, and this one is the NetworkX value:
+ * the legacy degree counts a self-loop once and reads only out-neighbours on a directed graph, so
+ * its degrees do not sum to 2m.
+ *
+ * It is NOT the legacy `calculateMCLModularity`, in two ways. That function subtracts the null-model
+ * term `d(u) d(v) / 2m` once per edge whatever the partition: on two separate triangles it scores
+ * one community and the two triangles both 1/3, where this returns 0 and 1/2. And it ignores edge
+ * weights, where this reads the snapshot's weights by default; pass `weights` filled with 1 for
+ * the unweighted value.
+ * @param s - Any snapshot or adjacency view
+ * @param labels - Community of every node; `INVALID_INDEX` leaves a node out of every community
+ * @param options - Resolution and the weight override
+ * @returns The modularity, 0 when the snapshot has no edge weight
+ * @public
+ */
+export declare function modularity(s: AdjacencyView, labels: U32, options?: ModularityOptions): number;
+//# sourceMappingURL=modularity.d.ts.map

package/dist/src/indexed/modularity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularity.d.ts","sourceRoot":"","sources":["../../../src/indexed/modularity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAiB,KAAK,aAAa,EAAE,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAExG,qDAAqD;AACrD,MAAM,WAAW,iBAAiB;IAC9B,wEAAwE;IACxE,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,iGAAiG;IACjG,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,GAAE,iBAAsB,GAAG,MAAM,CA8CjG"}

package/dist/src/indexed/modularity.js

@@ -0,0 +1,74 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+/**
+ * Newman's modularity of a partition: `sum_c in_c / 2m - gamma * (tot_c / 2m)^2`, where `2m` is
+ * twice the total edge weight, `in_c` counts every edge inside community c twice and `tot_c` sums
+ * its nodes' weighted degrees. Degrees follow graph-format's `weightedDegree()` convention -- a
+ * self-loop counts twice -- so `sum(tot_c) === 2m`. On a directed snapshot the direction is
+ * ignored: every arc counts as an undirected edge, and a node's degree is its in-weight plus its
+ * out-weight.
+ *
+ * On an undirected snapshot without self-loops this equals the legacy `calculateModularity`. On
+ * a directed snapshot or one with self-loops the two differ, and this one is the NetworkX value:
+ * the legacy degree counts a self-loop once and reads only out-neighbours on a directed graph, so
+ * its degrees do not sum to 2m.
+ *
+ * It is NOT the legacy `calculateMCLModularity`, in two ways. That function subtracts the null-model
+ * term `d(u) d(v) / 2m` once per edge whatever the partition: on two separate triangles it scores
+ * one community and the two triangles both 1/3, where this returns 0 and 1/2. And it ignores edge
+ * weights, where this reads the snapshot's weights by default; pass `weights` filled with 1 for
+ * the unweighted value.
+ * @param s - Any snapshot or adjacency view
+ * @param labels - Community of every node; `INVALID_INDEX` leaves a node out of every community
+ * @param options - Resolution and the weight override
+ * @returns The modularity, 0 when the snapshot has no edge weight
+ * @public
+ */
+export function modularity(s, labels, options = {}) {
+    const resolution = options.resolution ?? 1;
+    const weights = options.weights ?? s.weights;
+    if (labels.length !== s.nodeCount) {
+        throw new RangeError(`labels has ${labels.length} entries; the snapshot has ${s.nodeCount} nodes`);
+    }
+    if (weights !== null && weights.length !== s.arcCount) {
+        throw new RangeError(`weights has ${weights.length} entries; the snapshot has ${s.arcCount} arcs`);
+    }
+    const tot = new Map();
+    const inside = new Map();
+    const addTo = (map, label, w) => {
+        if (label !== INVALID_INDEX) {
+            map.set(label, (map.get(label) ?? 0) + w);
+        }
+    };
+    let m2 = 0;
+    for (let u = 0; u < s.nodeCount; u++) {
+        const end = s.rowPtr[u + 1];
+        for (let a = s.rowPtr[u]; a < end; a++) {
+            const v = s.colIdx[a];
+            const w = weights === null ? 1 : weights[a];
+            // An undirected edge between two nodes is read from both rows; a self-loop and a
+            // directed arc only once, so they count double here.
+            const twice = s.directed || v === u ? 2 * w : w;
+            m2 += twice;
+            if (s.directed) {
+                addTo(tot, labels[u], w);
+                addTo(tot, labels[v], w);
+            }
+            else {
+                addTo(tot, labels[u], twice);
+            }
+            if (labels[u] === labels[v]) {
+                addTo(inside, labels[u], twice);
+            }
+        }
+    }
+    if (m2 === 0) {
+        return 0;
+    }
+    let q = 0;
+    for (const [label, degrees] of tot) {
+        const share = degrees / m2;
+        q += (inside.get(label) ?? 0) / m2 - resolution * share * share;
+    }
+    return q;
+}
+//# sourceMappingURL=modularity.js.map

package/dist/src/indexed/modularity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularity.js","sourceRoot":"","sources":["../../../src/indexed/modularity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,aAAa,EAAgC,MAAM,uBAAuB,CAAC;AAUxG;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,UAAU,CAAC,CAAgB,EAAE,MAAW,EAAE,UAA6B,EAAE;IACrF,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;IAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;QAChC,MAAM,IAAI,UAAU,CAAC,cAAc,MAAM,CAAC,MAAM,8BAA8B,CAAC,CAAC,SAAS,QAAQ,CAAC,CAAC;IACvG,CAAC;IACD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QACpD,MAAM,IAAI,UAAU,CAAC,eAAe,OAAO,CAAC,MAAM,8BAA8B,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;IACvG,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,CAAC,GAAwB,EAAE,KAAa,EAAE,CAAS,EAAQ,EAAE;QACvE,IAAI,KAAK,KAAK,aAAa,EAAE,CAAC;YAC1B,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC,CAAC;IACF,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5C,iFAAiF;YACjF,qDAAqD;YACrD,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,EAAE,IAAI,KAAK,CAAC;YACZ,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACb,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACJ,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACjC,CAAC;YACD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACpC,CAAC;QACL,CAAC;IACL,CAAC;IACD,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,CAAC;IACb,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,OAAO,GAAG,EAAE,CAAC;QAC3B,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,UAAU,GAAG,KAAK,GAAG,KAAK,CAAC;IACpE,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC"}

package/dist/src/indexed/mst.d.ts

@@ -1,4 +1,4 @@
-import type { GraphSnapshot, NumericVector, U32 } from "@graphty/graph-format";
+import { type GraphSnapshot, type NumericVector, type U32 } from "@graphty/graph-format";
 /** Options of the index-based MST. @public */
 export interface MstOptions {
     /** Per-arc weight override, arcCount long; gathered back to per-edge through `edgeToArc`. */
@@ -23,4 +23,32 @@ export interface MstResult {
  * @public
  */
 export declare function kruskalMST(s: GraphSnapshot, o?: MstOptions): MstResult;
+/** Options of the index-based Prim. @public */
+export interface PrimOptions extends MstOptions {
+    /** The node index the (first) tree grows from; default 0. */
+    readonly start?: number | undefined;
+    /**
+     * Grow a tree in every component, rooted at `start` and then at each component's lowest node
+     * index, instead of throwing on a disconnected graph. Default false, as legacy `primMST`.
+     */
+    readonly forest?: boolean | undefined;
+}
+/** Result of the index-based Prim: the MST result plus each node's discovery arc. @public */
+export interface PrimResult extends MstResult {
+    /** The tree arc that reached each node, pointing at it; INVALID_INDEX for every root. */
+    readonly predArc: U32;
+}
+/**
+ * Prim's minimum spanning tree, grown from a start node by always taking the cheapest arc from the
+ * tree to a node outside it (an indexed heap keyed per node, so of several parallel edges the
+ * cheapest, and of equal ones the lowest-indexed, is the one taken). `edges` lists the logical
+ * edges in the order they joined the tree and `totalWeight` sums them in that order, as legacy
+ * `primMST` does. The start index is checked: one outside the graph throws a RangeError.
+ * @param s - An undirected snapshot
+ * @param o - Per-arc weight override, start node and the spanning-forest switch
+ * @returns The accepted edges, their total weight and the discovery arc per node
+ * @throws Error on a directed snapshot, and on a disconnected one unless `forest` is set
+ * @public
+ */
+export declare function primMST(s: GraphSnapshot, o?: PrimOptions): PrimResult;
 //# sourceMappingURL=mst.d.ts.map

package/dist/src/indexed/mst.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mst.d.ts","sourceRoot":"","sources":["../../../src/indexed/mst.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAI/E,8CAA8C;AAC9C,MAAM,WAAW,UAAU;IACvB,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED,kGAAkG;AAClG,MAAM,WAAW,SAAS;IACtB,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,0CAA0C;IAC1C,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAChC;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAE,UAAe,GAAG,SAAS,CAgC1E"}
+{"version":3,"file":"mst.d.ts","sourceRoot":"","sources":["../../../src/indexed/mst.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAiB,KAAK,aAAa,EAAE,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAKxG,8CAA8C;AAC9C,MAAM,WAAW,UAAU;IACvB,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED,kGAAkG;AAClG,MAAM,WAAW,SAAS;IACtB,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,0CAA0C;IAC1C,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAChC;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAE,UAAe,GAAG,SAAS,CAgC1E;AAED,+CAA+C;AAC/C,MAAM,WAAW,WAAY,SAAQ,UAAU;IAC3C,6DAA6D;IAC7D,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC;;;OAGG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CACzC;AAED,6FAA6F;AAC7F,MAAM,WAAW,UAAW,SAAQ,SAAS;IACzC,yFAAyF;IACzF,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;CACzB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAE,WAAgB,GAAG,UAAU,CA8CzE"}