-
It would be nice if Dyna had some kind of randomization, so students could play around with generating random ngram sentences.
-
Hi Achim,
I'm trying to use blueprints.net, but I find it rather hard to understand what is going on.
I'd really like to use it, but it seems rather overengineered, and I might think other people wou…
-
```
There has been some interest in a multigraph implementation. Both digraph
and graph classes should have their respective multigraph implementation.
Hypergraphs already support it out of the box.
…
-
`prev_edges` and `next_edges` are not set in `add_edge`. `add_node` seems to do the same as when constructing from a `networkx` graph, except that hyperedge nodes are not supported. This might be okay…
-
```
There has been some interest in a multigraph implementation. Both digraph
and graph classes should have their respective multigraph implementation.
Hypergraphs already support it out of the box.
…
-
Should I use edge_weight_prop,and node_weight_prop to assign values to edge weights and node weights? I noticed that there is a cell_weigh property, I want to know what cell weight represents
-
```
There has been some interest in a multigraph implementation. Both digraph
and graph classes should have their respective multigraph implementation.
Hypergraphs already support it out of the box.
…
-
### Describe the bug
We experience this bug when using Impersonation in Metabase Enterprise (see below how to reproduce more exactly):
```
class clojure.lang.PersistentVector cannot be cast to clas…
s-huk updated
2 months ago
-
Similar to #266, the `__getitem__` method is not implemented consistently across different complex types:
- For simplicial complexes, `SC[simplex]` returns the user-defined attributes associated wi…
-
I'm trying to build a hypergraph which has ~3.8M nodes and ~7.1M hyperedges.
My first attempt was to build a dictionary of edge -> nodelist so I could do a simple `Hypergraph(dict)` as per the docs…