@hpcc-js/util 2.52.0 → 3.1.0

package/lib-es6/graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":";AAAA;IAKI,mBAAY,KAAqB,EAAE,MAAgC;QAF1D,UAAK,GAA2B,EAAE,CAAC;QAGxC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IACL,gBAAC;AAAD,CAAC,AATD,IASC;;AAED;IAAuC,4BAAkB;IAMrD,kBAAY,KAAqB,EAAE,MAAgC,EAAE,CAAK;QACtE,YAAA,MAAK,YAAC,KAAK,EAAE,MAAM,CAAC,SAAC;QANhB,eAAS,GAA6B,EAAE,CAAC;QACzC,cAAQ,GAA2B,EAAE,CAAC;QACtC,WAAK,GAAyB,EAAE,CAAC;QAKtC,IAAI,MAAM,EAAE,CAAC,CAAE,8BAA8B;YACzC,MAAM,CAAC,YAAY,CAAC,KAAI,CAAC,CAAC;QAC9B,CAAC;QACD,KAAI,CAAC,CAAC,GAAG,CAAC,CAAC;;IACf,CAAC;IAED,yBAAM,GAAN,UAAO,IAAoB;QAApB,qBAAA,EAAA,WAAoB;QACvB,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,iCAAc,GAAd,UAAe,CAAK;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,+BAAY,GAAZ,UAAa,QAA2B;QACpC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC;IAED,kCAAe,GAAf,UAAgB,QAA2B;QACvC,IAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,qCAAkB,GAAlB;QACI,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC;IACL,CAAC;IAED,+BAAY,GAAZ,UAAa,CAAK;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,6BAAU,GAAV,UAAW,MAAuB;QAC9B,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,gCAAa,GAAb,UAAc,MAAuB;QACjC,IAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,oCAAiB,GAAjB;QACI,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACrD,CAAC;IACL,CAAC;IAED,6BAAU,GAAV,UAAW,MAAuB,EAAE,MAAuB,EAAE,CAAK;QAC9D,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,2BAAQ,GAAR,UAAS,IAAmB;QACxB,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,8BAAW,GAAX,UAAY,IAAmB;QAC3B,IAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,uBAAI,GAAJ,UAAK,IAAyD;QAC1D,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;aAAM,IAAI,IAAI,YAAY,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;IACL,eAAC;AAAD,CAAC,AAhGD,CAAuC,SAAS,GAgG/C;;AAED;IAAqC,0BAAkB;IAQnD,gBAAY,KAAqB,EAAE,MAAyB,EAAE,CAAK;QAC/D,YAAA,MAAK,YAAC,KAAK,EAAE,MAAM,CAAC,SAAC;QARhB,aAAO,GAAyB,EAAE,CAAC;QACnC,cAAQ,GAAyB,EAAE,CAAC;QAQzC,MAAM,CAAC,UAAU,CAAC,KAAI,CAAC,CAAC;QACxB,KAAI,CAAC,CAAC,GAAG,CAAC,CAAC;;IACf,CAAC;IATD,sBAAI,yBAAK;aAAT;YACI,uCAAW,IAAI,CAAC,OAAO,SAAK,IAAI,CAAC,QAAQ,QAAE;QAC/C,CAAC;;;OAAA;IASD,uBAAM,GAAN,UAAO,IAAoB,EAAE,CAA+B;QAArD,qBAAA,EAAA,WAAoB;QACvB,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,0BAAS,GAAT,UAAU,IAAmB;QACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,6BAAY,GAAZ,UAAa,IAAmB;QAC5B,IAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,2BAAU,GAAV,UAAW,IAAmB;QAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,8BAAa,GAAb,UAAc,IAAmB;QAC7B,IAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IACL,aAAC;AAAD,CAAC,AAzCD,CAAqC,SAAS,GAyC7C;;AAED;IAAmC,wBAAkB;IAKjD,cAAY,KAAqB,EAAE,MAAyB,EAAE,MAAuB,EAAE,MAAuB,EAAE,CAAK;QACjH,YAAA,MAAK,YAAC,KAAK,EAAE,MAAM,CAAC,SAAC;QACrB,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,CAAC,QAAQ,CAAC,KAAI,CAAC,CAAC;QACtB,KAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,KAAI,CAAC,MAAM,CAAC,UAAU,CAAC,KAAI,CAAC,CAAC;QAC7B,KAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,KAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAI,CAAC,CAAC;QAC5B,KAAI,CAAC,CAAC,GAAG,CAAC,CAAC;;IACf,CAAC;IAED,qBAAM,GAAN;QACI,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACL,WAAC;AAAD,CAAC,AAxBD,CAAmC,SAAS,GAwB3C;;AAED;IAWI,eAAY,IAAiG,EAAE,CAAK;QAAxG,qBAAA,EAAA,iBAA8E,IAAI,IAAI,OAAA,EAAE,GAAG,IAAI,CAAC,CAAC,EAAX,CAAW;QATrG,kBAAa,GAA6B,EAAE,CAAC;QAC7C,qBAAgB,GAAwC,EAAE,CAAC;QAC3D,iBAAY,GAA2B,EAAE,CAAC;QAC1C,oBAAe,GAAsC,EAAE,CAAC;QACxD,cAAS,GAAyB,EAAE,CAAC;QACrC,iBAAY,GAAoC,EAAE,CAAC;QAKvD,IAAI,CAAC,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,8BAAc,GAAd,UAAe,MAA0B,EAAE,CAAK;QAC5C,IAAM,MAAM,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;QAClD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,8BAAc,GAAd,UAAe,QAA2B,EAAE,IAAoB;QAAhE,iBAcC;QAd2C,qBAAA,EAAA,WAAoB;QAC5D,IAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAClD,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YAClB,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC9C,CAAC;QACD,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,CAAC,CAAC,KAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAA9D,CAA8D,CAAC,CAAC;QAC/F,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAA,MAAM,IAAI,OAAA,IAAI,CAAC,CAAC,CAAC,KAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAO,CAAC,UAAU,CAAC,MAAM,CAAC,EAA5E,CAA4E,CAAC,CAAC;QAClH,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,UAAA,aAAa,IAAI,OAAA,IAAI,CAAC,CAAC,CAAC,KAAI,CAAC,cAAc,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAO,CAAC,YAAY,CAAC,aAAa,CAAC,EAA9F,CAA8F,CACzI,CAAC;IACN,CAAC;IAED,sBAAI,4BAAS;aAAb;YACI,OAAO,IAAI,CAAC,aAAa,CAAC;QAC9B,CAAC;;;OAAA;IAED,wBAAQ,GAAR,UAAS,EAAU;QACf,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,4BAAY,GAAZ,UAAa,MAAyB,EAAE,CAAK;QACzC,IAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;QACjD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,4BAAY,GAAZ,UAAa,MAAuB,EAAE,IAAoB,EAAE,CAA+B;QAA3F,iBAmBC;QAnBqC,qBAAA,EAAA,WAAoB;QACtD,IAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/C,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,UAAA,MAAM;gBACzB,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAA,OAAO;oBAC3B,KAAI,CAAC,UAAU,CAAC,KAAI,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAE,EAAE,OAAO,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACtH,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;QACP,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,UAAA,IAAI,IAAI,OAAA,KAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAArB,CAAqB,CAAC,CAAC;QACtD,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAA,IAAI,IAAI,OAAA,KAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAArB,CAAqB,CAAC,CAAC;IAC3D,CAAC;IAED,sBAAI,2BAAQ;aAAZ;YACI,OAAO,IAAI,CAAC,YAAY,CAAC;QAC7B,CAAC;;;OAAA;IAED,sBAAM,GAAN,UAAO,EAAU;QACb,OAAO,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,0BAAU,GAAV,UAAW,MAAyB,EAAE,MAAuB,EAAE,MAAuB,EAAE,CAAK;QACzF,IAAM,MAAM,GAAG,IAAI,IAAI,CAAU,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;QAC9C,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,0BAAU,GAAV,UAAW,IAAmB;QAC1B,IAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,sBAAI,wBAAK;aAAT;YACI,OAAO,IAAI,CAAC,SAAS,CAAC;QAC1B,CAAC;;;OAAA;IAED,oBAAI,GAAJ,UAAK,EAAU;QACX,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAEO,qBAAK,GAAb,UAAc,MAAyB,EAAE,OAAkE;QACvG,KAAuB,UAAgB,EAAhB,KAAA,MAAM,CAAC,SAAS,EAAhB,cAAgB,EAAhB,IAAgB,EAAE,CAAC;YAArC,IAAM,QAAQ,SAAA;YACf,QAAQ,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxB,KAAK,OAAO;oBACR,OAAO,IAAI,CAAC;gBAChB,KAAK,UAAU;oBACX,MAAM;gBACV;oBACI,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC;wBAAE,OAAO,IAAI,CAAC;YACvD,CAAC;QACL,CAAC;QACD,KAAqB,UAAe,EAAf,KAAA,MAAM,CAAC,QAAQ,EAAf,cAAe,EAAf,IAAe,EAAE,CAAC;YAAlC,IAAM,MAAM,SAAA;YACb,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,OAAO;gBAAE,OAAO,IAAI,CAAC;QACjD,CAAC;IACL,CAAC;IAED,oBAAI,GAAJ,UAAK,OAAqE;QACtE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/B,KAAmB,UAAc,EAAd,KAAA,IAAI,CAAC,SAAS,EAAd,cAAc,EAAd,IAAc,EAAE,CAAC;YAA/B,IAAM,IAAI,SAAA;YACX,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,OAAO;gBAAE,OAAO,IAAI,CAAC;QAC/C,CAAC;IACL,CAAC;IAED,qBAAK,GAAL;QACI,IAAM,IAAI,GAA+G,IAAI,CAAC,WAAkB,CAAC;QACjJ,IAAM,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChD,IAAM,GAAG,GAAG,MAAM,EAAE,CAAC;QACrB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,UAAA,IAAI;YACV,IAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;gBAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,CAAC;iBAAM,IAAI,IAAI,YAAY,MAAM,EAAE,CAAC;gBAChC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC;iBAAM,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;gBAC9B,IAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC;QACL,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAClB,CAAC;IACL,YAAC;AAAD,CAAC,AA1JD,IA0JC;;AAED,SAAS,MAAM;IACX,IAAM,IAAI,GAAU,EAAE,CAAC;IACvB,IAAM,MAAM,GAAU,EAAE,CAAC;IAEzB,OAAO;QACH,GAAG,YAAC,GAAQ,EAAE,KAAU;YACpB,IAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;YAC1B,CAAC;QACL,CAAC;QACD,GAAG,YAAC,GAAQ;YACR,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC;KACJ,CAAC;AACN,CAAC"}

package/lib-es6/graph2.js

@@ -1,619 +0,0 @@
-import { __extends, __spreadArray } from "tslib";
-import { compare2 } from "./array";
-var GraphItem = /** @class */ (function () {
-    function GraphItem(g, _) {
-        this._graph = g;
-        this._ = _;
-    }
-    GraphItem.prototype.id = function () {
-        return this._graph.id(this._);
-    };
-    return GraphItem;
-}());
-var ChildGraphItem = /** @class */ (function (_super) {
-    __extends(ChildGraphItem, _super);
-    function ChildGraphItem(g, _) {
-        return _super.call(this, g, _) || this;
-    }
-    ChildGraphItem.prototype.clearParent = function () {
-        if (this._parent) {
-            this._parent.removeChild(this);
-            delete this._parent;
-        }
-        return this;
-    };
-    ChildGraphItem.prototype.parent = function (_) {
-        if (arguments.length === 0)
-            return this._parent;
-        if (this._parent !== _) {
-            if (this._parent) {
-                this._parent.removeChild(this);
-            }
-            this._parent = _;
-            if (this._parent) {
-                this._parent.addChild(this);
-            }
-        }
-        return this;
-    };
-    return ChildGraphItem;
-}(GraphItem));
-var Subgraph = /** @class */ (function (_super) {
-    __extends(Subgraph, _super);
-    function Subgraph(g, _) {
-        var _this = _super.call(this, g, _) || this;
-        _this._children = [];
-        return _this;
-    }
-    Subgraph.prototype.children = function () {
-        return this._children;
-    };
-    Subgraph.prototype.addChild = function (_) {
-        this._children.push(_);
-    };
-    Subgraph.prototype.removeChild = function (_) {
-        this._children = this._children.filter(function (row) { return row.id !== _.id; });
-    };
-    return Subgraph;
-}(ChildGraphItem));
-var Vertex = /** @class */ (function (_super) {
-    __extends(Vertex, _super);
-    function Vertex(g, _) {
-        var _this = _super.call(this, g, _) || this;
-        _this._inEdges = [];
-        _this._outEdges = [];
-        return _this;
-    }
-    Vertex.prototype.edges = function () {
-        return __spreadArray(__spreadArray([], this._inEdges, true), this._outEdges, true);
-    };
-    Vertex.prototype.edgeCount = function () {
-        return this._outEdges.length + this._inEdges.length;
-    };
-    Vertex.prototype.inEdges = function () {
-        return this._inEdges;
-    };
-    Vertex.prototype.addInEdge = function (e) {
-        this._inEdges.push(e);
-    };
-    Vertex.prototype.removeInEdge = function (id) {
-        this._inEdges = this._inEdges.filter(function (e) { return e._.id !== id; });
-    };
-    Vertex.prototype.outEdges = function () {
-        return this._outEdges;
-    };
-    Vertex.prototype.addOutEdge = function (e) {
-        this._outEdges.push(e);
-    };
-    Vertex.prototype.removeOutEdge = function (id) {
-        this._outEdges = this._outEdges.filter(function (e) { return e._.id !== id; });
-    };
-    return Vertex;
-}(ChildGraphItem));
-var Edge = /** @class */ (function (_super) {
-    __extends(Edge, _super);
-    function Edge(g, _, source, target) {
-        var _this = _super.call(this, g, _) || this;
-        _this._source = source;
-        _this._target = target;
-        return _this;
-    }
-    return Edge;
-}(ChildGraphItem));
-var Graph2 = /** @class */ (function () {
-    function Graph2(directed) {
-        if (directed === void 0) { directed = true; }
-        this._subgraphMap = {};
-        this._vertexMap = {};
-        this._edgeMap = {};
-        this._idFunc = function (_) { return typeof _.id === "function" ? _.id() : _.id; };
-        this._sourceFunc = function (_) { return typeof _.source === "function" ? _.source() : _.source; };
-        this._targetFunc = function (_) { return typeof _.target === "function" ? _.target() : _.target; };
-        this._updateFunc = function (before, after) { return after; };
-        this._directed = directed;
-    }
-    Graph2.prototype.clear = function () {
-        this._subgraphMap = {};
-        this._vertexMap = {};
-        this._edgeMap = {};
-        return this;
-    };
-    Graph2.prototype.clearParents = function () {
-        for (var key in this._subgraphMap) {
-            this._subgraphMap[key].clearParent();
-        }
-        for (var key in this._vertexMap) {
-            this._vertexMap[key].clearParent();
-        }
-        return this;
-    };
-    Graph2.prototype.isDirected = function () {
-        return this._directed;
-    };
-    Graph2.prototype.idFunc = function (_) {
-        this._idFunc = _;
-        return this;
-    };
-    Graph2.prototype.sourceFunc = function (_) {
-        this._sourceFunc = _;
-        return this;
-    };
-    Graph2.prototype.targetFunc = function (_) {
-        this._targetFunc = _;
-        return this;
-    };
-    Graph2.prototype.updateFunc = function (_) {
-        this._updateFunc = _;
-        return this;
-    };
-    Graph2.prototype.id = function (_) {
-        return this._idFunc(_);
-    };
-    Graph2.prototype.type = function (id) {
-        if (this.subgraphExists(id))
-            return "S";
-        if (this.vertexExists(id))
-            return "V";
-        if (this.edgeExists(id))
-            return "E";
-        return "";
-    };
-    Graph2.prototype.isSubgraph = function (_) {
-        return this.subgraphExists(this.id(_));
-    };
-    Graph2.prototype.isVertex = function (_) {
-        return this.vertexExists(this.id(_));
-    };
-    Graph2.prototype.isEdge = function (_) {
-        return this.edgeExists(this.id(_));
-    };
-    Graph2.prototype.allItems = function () {
-        return __spreadArray(__spreadArray(__spreadArray([], this.allSubgraphs(), true), this.allVertices(), true), this.allEdges(), true);
-    };
-    Graph2.prototype.item = function (id) {
-        if (this.subgraphExists(id))
-            return this.subgraph(id);
-        if (this.vertexExists(id))
-            return this.vertex(id);
-        if (this.edgeExists(id))
-            return this.edge(id);
-        return undefined;
-    };
-    Graph2.prototype.itemExists = function (id) {
-        return this.edgeExists(id) || this.vertexExists(id) || this.subgraphExists(id);
-    };
-    // Subgraphs  ---
-    Graph2.prototype.allSubgraphs = function () {
-        var retVal = [];
-        for (var key in this._subgraphMap) {
-            retVal.push(this._subgraphMap[key]._);
-        }
-        return retVal;
-    };
-    Graph2.prototype.subgraphs = function () {
-        var retVal = [];
-        for (var key in this._subgraphMap) {
-            if (this._subgraphMap[key].parent() === undefined) {
-                retVal.push(this._subgraphMap[key]._);
-            }
-        }
-        return retVal;
-    };
-    Graph2.prototype.subgraphExists = function (id) {
-        return !!this._subgraphMap[id];
-    };
-    Graph2.prototype.subgraph = function (id) {
-        return this._subgraphMap[id]._;
-    };
-    Graph2.prototype.subgraphSubgraphs = function (id) {
-        var _this = this;
-        return this._subgraphMap[id].children().filter(function (child) { return _this.isSubgraph(child._); }).map(function (child) { return child._; });
-    };
-    Graph2.prototype.subgraphVertices = function (id) {
-        var _this = this;
-        return this._subgraphMap[id].children().filter(function (child) { return _this.isVertex(child._); }).map(function (child) { return child._; });
-    };
-    Graph2.prototype.subgraphEdges = function (id) {
-        var _this = this;
-        return this._subgraphMap[id].children().filter(function (child) { return _this.isEdge(child._); }).map(function (child) { return child._; });
-    };
-    Graph2.prototype.addSubgraph = function (s, parent) {
-        var s_id = this._idFunc(s);
-        if (this._subgraphMap[s_id])
-            throw new Error("Subgraph '".concat(s_id, "' already exists."));
-        var subgraph = new Subgraph(this, s);
-        if (parent) {
-            var p_id = this._idFunc(parent);
-            if (!this._subgraphMap[p_id])
-                throw new Error("Subgraph '".concat(p_id, "' does not exist."));
-            subgraph.parent(this._subgraphMap[p_id]);
-        }
-        this._subgraphMap[s_id] = subgraph;
-        return this;
-    };
-    Graph2.prototype.mergeSubgraphs = function (_subgraphs) {
-        var _this = this;
-        if (_subgraphs === void 0) { _subgraphs = []; }
-        var sgDiff = compare2(this.allSubgraphs(), _subgraphs, function (sg) { return _this._idFunc(sg); }, this._updateFunc);
-        sgDiff.exit.forEach(function (sg) { return _this.removeSubgraph(_this._idFunc(sg)); });
-        sgDiff.enter.forEach(function (sg) { return _this.addSubgraph(sg); });
-        sgDiff.update.forEach(function (sg) { return _this.updateSubgraph(sg); });
-        return this;
-    };
-    Graph2.prototype.updateSubgraph = function (sg) {
-        var sg_id = this._idFunc(sg);
-        var subgraph = this._subgraphMap[sg_id];
-        if (!subgraph)
-            throw new Error("Subgraph '".concat(sg_id, "' does not exist."));
-        subgraph._ = sg;
-        return this;
-    };
-    Graph2.prototype.removeSubgraph = function (id, promoteChildren) {
-        var _this = this;
-        if (promoteChildren === void 0) { promoteChildren = true; }
-        var sg = this._subgraphMap[id];
-        if (!sg)
-            throw new Error("Subgraph '".concat(id, "' does not exist."));
-        sg.children().forEach(function (child) {
-            if (promoteChildren) {
-                child.parent(sg.parent());
-            }
-            else {
-                if (child instanceof Subgraph) {
-                    _this.removeSubgraph(child.id());
-                }
-                else {
-                    _this.removeVertex(child.id());
-                }
-            }
-        });
-        delete this._subgraphMap[id];
-        return this;
-    };
-    Graph2.prototype.subgraphParent = function (id, parentID) {
-        var item = this._subgraphMap[id];
-        if (!item)
-            throw new Error("Subgraph '".concat(id, "' does not exist."));
-        if (parentID === void 0) {
-            var parent_1 = item.parent();
-            return parent_1 ? parent_1._ : undefined;
-        }
-        var parent = this._subgraphMap[parentID];
-        if (!parent)
-            throw new Error("Vertex parent '".concat(parent, "' does not exist."));
-        item.parent(parent);
-        return this;
-    };
-    // Vertices  ---
-    Graph2.prototype.allVertices = function () {
-        var retVal = [];
-        for (var key in this._vertexMap) {
-            retVal.push(this._vertexMap[key]._);
-        }
-        return retVal;
-    };
-    Graph2.prototype.vertices = function () {
-        var retVal = [];
-        for (var key in this._vertexMap) {
-            if (this._vertexMap[key].parent() === undefined) {
-                retVal.push(this._vertexMap[key]._);
-            }
-        }
-        return retVal;
-    };
-    Graph2.prototype.vertexExists = function (id) {
-        return !!this._vertexMap[id];
-    };
-    Graph2.prototype.vertex = function (id) {
-        return this._vertexMap[id]._;
-    };
-    Graph2.prototype.allEdges = function () {
-        var retVal = [];
-        for (var key in this._edgeMap) {
-            retVal.push(this._edgeMap[key]._);
-        }
-        return retVal;
-    };
-    Graph2.prototype.edges = function () {
-        var retVal = [];
-        for (var key in this._edgeMap) {
-            if (this._edgeMap[key].parent() === undefined) {
-                retVal.push(this._edgeMap[key]._);
-            }
-        }
-        return retVal;
-    };
-    Graph2.prototype.vertexEdges = function (vertexID) {
-        return this._vertexMap[vertexID].edges().map(function (e) { return e._; });
-    };
-    Graph2.prototype.inEdges = function (vertexID) {
-        return this._vertexMap[vertexID].inEdges().map(function (e) { return e._; });
-    };
-    Graph2.prototype.outEdges = function (vertexID) {
-        return this._vertexMap[vertexID].outEdges().map(function (e) { return e._; });
-    };
-    Graph2.prototype._neighbors = function (id) {
-        return __spreadArray(__spreadArray([], this._vertexMap[id].outEdges().map(function (e) { return e._target; }), true), this._vertexMap[id].inEdges().map(function (e) { return e._source; }), true);
-    };
-    Graph2.prototype.neighbors = function (id) {
-        return this._neighbors(id).map(function (n) { return n._; });
-    };
-    Graph2.prototype.singleNeighbors = function (id) {
-        return this._neighbors(id).filter(function (n) { return n.edgeCount() === 1; }).map(function (n) { return n._; });
-    };
-    Graph2.prototype.addVertex = function (v, parent) {
-        var v_id = this._idFunc(v);
-        if (this._vertexMap[v_id])
-            throw new Error("Vertex '".concat(v_id, "' already exists."));
-        var vertex = new Vertex(this, v);
-        if (parent) {
-            var p_id = this._idFunc(parent);
-            if (!this.subgraphExists(p_id))
-                throw new Error("Subgraph '".concat(p_id, "' does not exist."));
-            vertex.parent(this._subgraphMap[p_id]);
-        }
-        this._vertexMap[v_id] = vertex;
-        return this;
-    };
-    Graph2.prototype.mergeVertices = function (_vertices) {
-        var _this = this;
-        var vDiff = compare2(this.allVertices(), _vertices, function (v) { return _this._idFunc(v); }, this._updateFunc);
-        vDiff.exit.forEach(function (v) { return _this.removeVertex(_this._idFunc(v)); });
-        vDiff.enter.forEach(function (v) { return _this.addVertex(v); });
-        vDiff.update.forEach(function (v) { return _this.updateVertex(v); });
-        return this;
-    };
-    Graph2.prototype.updateVertex = function (v) {
-        var v_id = this._idFunc(v);
-        var vertex = this._vertexMap[v_id];
-        if (!vertex)
-            throw new Error("Vertex '".concat(v_id, "' does not exist."));
-        vertex._ = v;
-        return this;
-    };
-    Graph2.prototype.removeVertex = function (id) {
-        var _this = this;
-        var v = this._vertexMap[id];
-        if (!v)
-            throw new Error("Vertex '".concat(id, "' does not exist."));
-        v.edges().forEach(function (e) {
-            _this.removeEdge(e.id());
-        });
-        delete this._vertexMap[id];
-        return this;
-    };
-    Graph2.prototype.vertexParent = function (id, parentID) {
-        var item = this._vertexMap[id];
-        if (!item)
-            throw new Error("Vertex '".concat(id, "' does not exist."));
-        if (parentID === void 0) {
-            var parent_2 = item.parent();
-            return parent_2 ? parent_2._ : undefined;
-        }
-        var parent = this._subgraphMap[parentID];
-        if (!parent)
-            throw new Error("Vertex parent '".concat(parent, "' does not exist."));
-        item.parent(parent);
-        return this;
-    };
-    // Edges  ---
-    Graph2.prototype.edgeExists = function (id) {
-        return !!this._edgeMap[id];
-    };
-    Graph2.prototype.edge = function (id) {
-        return this._edgeMap[id]._;
-    };
-    Graph2.prototype.addEdge = function (e, parent) {
-        var e_id = this._idFunc(e);
-        var e_source = this._sourceFunc(e);
-        var e_target = this._targetFunc(e);
-        if (this._edgeMap[e_id])
-            throw new Error("Edge '".concat(e_id, "' already exists."));
-        if (!this.vertexExists(e_source))
-            throw new Error("Edge Source '".concat(e_source, "' does not exist."));
-        if (!this.vertexExists(e_target))
-            throw new Error("Edge Target '".concat(e_target, "' does not exist."));
-        var edge = new Edge(this, e, this._vertexMap[e_source], this._vertexMap[e_target]);
-        if (parent) {
-            var p_id = this._idFunc(parent);
-            if (!this.subgraphExists(p_id))
-                throw new Error("Subgraph '".concat(p_id, "' does not exist."));
-            edge.parent(this._subgraphMap[p_id]);
-        }
-        this._edgeMap[e_id] = edge;
-        this._vertexMap[e_source].addOutEdge(edge);
-        this._vertexMap[e_target].addInEdge(edge);
-        return this;
-    };
-    Graph2.prototype.mergeEdges = function (_edges) {
-        var _this = this;
-        var eDiff = compare2(this.allEdges(), _edges, function (e) { return _this._idFunc(e); }, this._updateFunc);
-        eDiff.exit.forEach(function (e) { return _this.removeEdge(_this._idFunc(e)); });
-        eDiff.enter.forEach(function (e) { return _this.addEdge(e); });
-        eDiff.update.forEach(function (e) { return _this.updateEdge(e); });
-        return this;
-    };
-    Graph2.prototype.updateEdge = function (e) {
-        var _a, _b, _c, _d;
-        var e_id = this._idFunc(e);
-        var edge = this._edgeMap[e_id];
-        if (!edge)
-            throw new Error("Edge '".concat(e_id, "' does not exist."));
-        var old_source = edge._source.id();
-        var new_source = this._sourceFunc(e);
-        if (old_source !== new_source) {
-            (_a = this._vertexMap[old_source]) === null || _a === void 0 ? void 0 : _a.removeOutEdge(e_id);
-            (_b = this._vertexMap[new_source]) === null || _b === void 0 ? void 0 : _b.addOutEdge(edge);
-        }
-        var old_target = edge._target.id();
-        var new_target = this._targetFunc(e);
-        if (old_target !== new_target) {
-            (_c = this._vertexMap[old_target]) === null || _c === void 0 ? void 0 : _c.removeInEdge(e_id);
-            (_d = this._vertexMap[new_target]) === null || _d === void 0 ? void 0 : _d.addInEdge(edge);
-        }
-        edge._ = e;
-        edge._source = this._vertexMap[new_source];
-        edge._target = this._vertexMap[new_target];
-        return this;
-    };
-    Graph2.prototype.removeEdge = function (id) {
-        var e = this._edgeMap[id];
-        if (!e)
-            throw new Error("Edge '".concat(id, "' does not exist."));
-        var e_sourceID = this._idFunc(e._source._);
-        if (!this.vertexExists(e_sourceID))
-            throw new Error("Edge Source'".concat(e_sourceID, "' does not exist."));
-        this._vertexMap[e_sourceID].removeOutEdge(id);
-        var e_targetID = this._idFunc(e._target._);
-        if (!this.vertexExists(e_targetID))
-            throw new Error("Edge Target'".concat(e_targetID, "' does not exist."));
-        this._vertexMap[e_targetID].removeInEdge(id);
-        delete this._edgeMap[id];
-        return this;
-    };
-    Graph2.prototype._hwalk = function (item, formatter) {
-        var _this = this;
-        if (item instanceof Subgraph) {
-            return formatter("subgraph", item._, item.children().map(function (child) { return _this._hwalk(child, formatter); }));
-        }
-        else {
-            return formatter("vertex", item._);
-        }
-    };
-    Graph2.prototype.hierarchy = function (formatter) {
-        var retVal = [];
-        for (var id in this._subgraphMap) {
-            var sg = this._subgraphMap[id];
-            if (sg.parent() === undefined) {
-                retVal.push(this._hwalk(sg, formatter));
-            }
-        }
-        for (var id in this._vertexMap) {
-            var v = this._vertexMap[id];
-            if (v.parent() === undefined) {
-                retVal.push(this._hwalk(v, formatter));
-            }
-        }
-        return retVal;
-    };
-    Graph2.prototype.dijkstra = function (source, target) {
-        var edges = this.allEdges();
-        var Q = new Set();
-        var prev = {};
-        var dist = {};
-        var adj = {};
-        function vertex_with_min_dist(Q, dist) {
-            var min_distance = Infinity;
-            var u = null;
-            Q.forEach(function (v) {
-                if (dist[v] < min_distance) {
-                    min_distance = dist[v];
-                    u = v;
-                }
-            });
-            return u;
-        }
-        for (var i = 0; i < edges.length; i++) {
-            var v1 = this._sourceFunc(edges[i]);
-            var v2 = this._targetFunc(edges[i]);
-            var len_1 = 1;
-            Q.add(v1);
-            Q.add(v2);
-            dist[v1] = Infinity;
-            dist[v2] = Infinity;
-            if (adj[v1] === undefined)
-                adj[v1] = {};
-            if (adj[v2] === undefined)
-                adj[v2] = {};
-            adj[v1][v2] = len_1;
-            adj[v2][v1] = len_1;
-        }
-        dist[source] = 0;
-        while (Q.size) {
-            var u_1 = vertex_with_min_dist(Q, dist);
-            if (u_1 === null)
-                break;
-            var neighbors = Object.keys(adj[u_1]).filter(function (v) { return Q.has(v); }); // Neighbor still in Q
-            Q.delete(u_1);
-            if (u_1 === target)
-                break; // Break when the target has been found
-            for (var _i = 0, neighbors_1 = neighbors; _i < neighbors_1.length; _i++) {
-                var v = neighbors_1[_i];
-                var alt = dist[u_1] + adj[u_1][v];
-                if (alt < dist[v]) {
-                    dist[v] = alt;
-                    prev[v] = u_1;
-                }
-            }
-        }
-        var u = target;
-        var ids = [u];
-        var len = 0;
-        while (prev[u] !== undefined) {
-            ids.unshift(prev[u]);
-            len += adj[u][prev[u]];
-            u = prev[u];
-        }
-        return { ids: ids, len: len };
-    };
-    Graph2.prototype.sort = function (v_id) {
-        var retVal = [];
-        var visited = {};
-        var visit = function (vertex, ancestors) {
-            if (ancestors === void 0) { ancestors = []; }
-            var v_id = vertex.id();
-            if (visited[v_id])
-                return;
-            visited[v_id] = true;
-            ancestors.push(vertex);
-            vertex.outEdges().forEach(function (e) {
-                if (ancestors.indexOf(e._target) < 0) {
-                    visit(e._target, __spreadArray([], ancestors, true));
-                }
-            });
-            retVal.unshift(vertex._);
-        };
-        if (v_id) {
-            visit(this._vertexMap[v_id]);
-        }
-        else {
-            for (var key in this._vertexMap) {
-                visit(this._vertexMap[key]);
-            }
-        }
-        return retVal;
-    };
-    return Graph2;
-}());
-export { Graph2 };
-var Set = /** @class */ (function () {
-    function Set() {
-        this._content = [];
-    }
-    Object.defineProperty(Set.prototype, "size", {
-        get: function () {
-            return this._content.length;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Set.prototype.has = function (_) {
-        return this._content.indexOf(_) >= 0;
-    };
-    Set.prototype.add = function (_) {
-        if (!this.has(_)) {
-            this._content.push(_);
-        }
-    };
-    Set.prototype.delete = function (_) {
-        var idx = this._content.indexOf(_);
-        if (idx >= 0) {
-            this._content.splice(idx, 1);
-        }
-    };
-    Set.prototype.forEach = function (_) {
-        this._content.forEach(_);
-    };
-    return Set;
-}());
-//# sourceMappingURL=graph2.js.map