[architecture] create tree-shakable math/algorithms package in the mono-repo

[Yonava]

Context

I want a tree-shakable, zero-dependency, math/algorithms package in the mono-repo that just defines a bunch of standardized contracts that take a core graph (without plugins/extra add-ons) and cleanly computes on it. The contract should be minimal, and stateless, only to be wrapped with state later down the line if desired.

const { maxFlow, minCut } = computeFordFulkerson(coreGraph)