-
This library could also provide graph types that are not so common, for example [hypergraph](https://en.wikipedia.org/wiki/Hypergraph) or [mixed graph](https://en.wikipedia.org/wiki/Mixed_graph). I ha…
-
For now, the `Diagram` class is based on lists of boxes and offsets, it allows only to encode planar diagrams.
In order to encode diagrams in symmetric monoidal categories, we would need a graph-ba…
-
For large inputs (that exceed the CPU cache), we should be more careful with cache and memory usage during the construction. It should be possible to gain 10% to 20% in performance.
-
Clean up the imports to avoid importing unecessary stuff.
-
I was wondering if there exists functionality in `cotengra` or `quimb` or `opt_einsum` to parse a file for the purposes of calculating contraction costs alone, without needing or caring about the elem…
-
> Moving far beyond the simplistic string matching which NNexus does in the direction of HDM, we talked about far more sophisticated types of autolinking (which should have information stored in [Arxa…
-
I'm wondering if you would consider accepting an addition to add a `HyperEdge` trait,
which would allow the library to encode Hypergraphs.
Presumably it could be an edge with a `I: Iterator` in pl…
-
by default should these be presented as symmetric or upper triangular?
-
@linas @Habush
The scheme result of the annotation-service is supposed to be used for Pattern miner and PLN works. As the bio-atomspace is too big to work with, we wanted to have a smaller version…
-
Dear developers,
I'm now working with the mapper algorithm. I read the [documentation](https://kepler-mapper.scikit-tda.org/reference/stubs/kmapper.adapter.html#module-kmapper.adapter) and find th…