-
Compile a Feature List, and create a clean version of it in the github wiki.
This whole thing makes me think of looking for a virtual mouse in-browser javascript live demo system. There must be thing…
-
The main screen uses separate graphs for the following four algorithms: etchash, kawpow, autolykos, and randomx.
Since there are many more supported algorithms, unify these into a single graph to m…
-
- multiple edges
- curved edges
- heirarchical nodes (clustered)
- colors
- arbitrary images
- size/zooming
- deletion
- animations
- …and plenty more
-
Me and @shashi have discussed how we might use a graph-program-format as a kind of parallel IR.
The idea is to have an hourglass design; the DAG is a small core abstraction, above it you build parall…
-
**Describe the bug**
The subgraph direction features doesn't work anymore
**To Reproduce**
Steps to reproduce the behavior:
1. Create a graph
2. Add subgraphs with different directions
**Exp…
-
Currently the most time consuming component in nefi's algorithm section is guo hall. This algorithm already got some great optimizations through to the fact that the thinning module is written in c++.…
gdenn updated
8 years ago
-
Hey, I'm working on a [Go port of the MergingDigest](https://github.com/stripe/veneur/blob/master/tdigest/merging_digest.go). I noticed that you haven't finished updating your paper to cover the mergi…
-
I received the following feedback after my talk at Strange Loop. The feedback is quoted, my answers inline.
> 1. Code that has nothing to do with querying can often be expressed as a query. For ins…
-
Add projects under `/Data-structures/` for example a linked list implementation of a queue in C++ will go under the folder `C++/Data-Structures/Queue/`
abhpd updated
2 years ago
-
It looks like right now all edges have a weight of one, at least in the eccentricity score computation. Have you given any thought to allowing users to specify custom edge weight accessors to compute …