-
The machinery for converting wiring diagrams to morphism expressions should support traced monoidal categories.
This is not a purely mechanical job; some thinking will be needed. At the very least,…
-
### What should we add?
At the moment, `OptimizeSwapBeforeMeasure` has an unfortunate complexity where it iterates many times through a circuit, and looks like it even has a worst-case quadratic comp…
-
I had an object type with cyclic link. When I try to apply migration (by removing this object type) I am getting following error
```
edgedb error: InternalServerError: CycleError: dependency cycle…
-
Dear mantainers,
I'd like to use the biobakery workflow to perform my analysis on 16s data.
I'm currently using the Docker container ([https://hub.docker.com/r/biobakery/workflows](https://hub.docke…
-
Overview:
Topological sorting is an essential algorithm used to order the vertices of a Directed Acyclic Graph (DAG) such that for every directed edge u -> v, vertex u comes before vertex v in the or…
-
Tracker issue for improvements to `EXPLAIN (opt, env)` / `EXPLAIN ANALYZE (DEBUG)`:
* [x] include distsql plan
* [x] include tables referenced by foreign keys (or remove unimportant foreign key refe…
-
**Describe the bug**
`digraph_utils:postorder/1` seems to return a wrong result, but it is consistent under a re-labelling of the vertices.
`digraph_utils:preorder/1` behaves differently on equivale…
-
There are a total of _n_ courses you have to take, labeled from `0` to `n-1`.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expresse…
-
### SQLDelight Version
2.0.2
### SQLDelight Dialect
postgresql
### Describe the Bug
When defining the schema with CREATE EXTENSION and CREATE TABLE statements I would expect them to be executed i…
-
"Topological sorting" is under-specified wrt the ordering of the independent vertices at each "level" of the sort. We could reflect this in the output type, by returning something like `[Set Vertex]`,…