Andrey Mokhov

> foldg'' We might call such folds "blindfolds" :-) Are numbers > 1 good? I'm sure I'll keep forgetting that :D Maybe should add `(good)`, `(bad)` to the table! By...

> It means that the displayed number will be k such that Alga = k * AlgaOld I'm afraid this doesn't help me, still takes me a while to understand...

Thanks @nobrakal! Perhaps, for `foldgWithoutEmpty'` you need to use parameter `Operator -> [b] -> b` instead? That might lead to a more efficient code.

> What do you mean? I mean the function signature should be: ```haskell foldgWithoutEmpty' :: (a -> b) -> (Operator -> [b] -> b) -> Graph a -> b foldgWithoutEmpty'...

I agree: `edges` is very often used to construct graphs, so we shouldn't assume graph expressions are coming in a better shape.

Interesting, that's an impressive speed up.

@phadej I agree that it's very inconvenient, so thanks for raising this issue! My plan was to eventually change the name of the type class, because the algebra works not...

In a recent discussion with colleagues, `Plex` came up as a possible name for the type class (there seem to be a nice correspondence between the algebra and topological concepts...

@glaebhoerl Yes, something like `IsGraph` is an option, but I believe we are looking for an abstract term. As an example, consider rings as a common abstraction for numbers. Then...

@phadej Indeed! I've set up a separate issue #31 to discuss non-empty graphs. > I'm quickly skimming thru the paper, and `empty` isn't used that much there! You are right,...