Andrey Mokhov
Andrey Mokhov
First of all, thank you for the great tool! It seems that `fsatrace` doesn't track reads from files that do not exist. For example, if the file `1.c` does not...
@bolt12 This replaces my previous PR #7. You don't have to merge it -- it's just an illustration of how the ideas from my experiment can be translated to your...
Waiting until 9.4 becomes available.
We used to have benchmarks running in CI on every commit, which helped us to catch performance regressions. This functionality was initially implemented in #82, but I accidentally dropped it...
(I think this is mostly relevant for undirected graphs.) _Graph complement_ of an undirected graph (V, E) is (V, K \ E), where K is the clique on all vertices...
We currently store vertices of type `a` directly in an `AdjacencyMap a`, which may lead to poor performance if the corresponding `Ord a` instance is slow. One example, which motivated...
There is a lot of code duplication in the testsuite currently. For example, see this commit: https://github.com/snowleopard/alga/commit/fc2854de76e7e05be5fd09c362750d6db9a05502. It should be possible to get rid of most duplication by defining generic...
We currently expose the implementation of the `Graph` datatype: ```haskell data Graph a = Empty | Vertex a | Overlay (Graph a) (Graph a) | Connect (Graph a) (Graph a)...
Despite having 640+ QuickCheck properties, test coverage of some modules is not great: | module | Top Level Definitions | Alternatives | Expressions | |----------------------------------------|-----------------------|--------------|-------------| | | % | %...
It would be great to have a table (say, in the `doc` folder) comparing different graph instances in terms of provided functionality (e.g., does it have `removeVertex`?) and performance (e.g....