-
There is a reference in the README that is not available from the develop branch. It will get taken care off when we go live, but if we want to make sure it is in the pypi readme we need to add it to…
-
## :rotating_light: The automated release from the `main` branch failed. :rotating_light:
I recommend you give this issue a high priority, so other packages depending on you can benefit from your bug…
-
This is an item that when checked, checks other items without being 'underneath' it in the graph. Maybe the graph structure is enough here.
-
- [ ] Match data with a pattern.
- [ ] Match by Id/Index of one or multiple links.
- [ ] Match by graph structure of link.
- [ ] Match by tree structure of link.
- [ ] Match by sequence structure of l…
-
In the python API, when create a class Trainer instance, we only need to put the output layer operation into it. I saw an article said that the prior layers will be trained using the computational gra…
-
## Summary
When loading a graph into _d3graph_ users must provide a dense adjacency matrix. This is inconvenient because most real-world graphs are sparse, and the dense representation is memory-in…
-
### Description
I ran into this problem while thinking of ways to break my inbound parentless sequential wall clock task spawning (which I may work the solution into).
A workflow with a mixed parent…
-
Generally speaking, creating a specific graph subtype struct (e.g. a directed graph or a bipartite graph) can be implemented by imposing constraints on a generic graph go struct. Upon every node inser…
-
Viewing of in-progress runs can be slow. This includes infrequently updating very large runs (few thousand tasks), or medium-sized runs that update frequently.
Graph update operations (e.g. calcul…
-
**Project Abstract**
This project is a small python computer application that can help a user to plan and pursue their goals. The application would allow the user to enter information about one or mo…