@julkas, thank you.
Especially with regard to randomized algorithms, I have not yet thought, now there is a desire to expand the set of supported types of graphs. But if you are interested in finding the minimum cut, the library has a deterministic algorithm.
As for Delphi compatibility: if Delphi will support helper inheritance and record management operators, why not?
The library is still in its infancy, a lot has to be changed, so as long as I don't see the point in writing documentation, it will have to be rewritten. So far, I've been trying to comment on classes and methods in detail.