-
Reported by **till** and assigned to **maeder**
Migrated from http://trac.informatik.uni-bremen.de:8080/hets/ticket/1066
[disprove_leu.log](https://github.com/spechub/attachment/blob/master/1066/dis…
-
It would be nice to be able to provide a gradient intensity. On my system, the per-polygon gradient is usually not strong enough so that the lattice looks more like a plain gradient on the whole scree…
-
Several functions have a `weights` parameter, but they don't always behave in the same way. The most common behaviour is the following:
1. If it is a numerical vector, these numbers are used as th…
-
It would be super-duper handy to be able to automatically generate input graphs and node selection lists (i.e., masks) to run with both NetworkX and `graphblas-algorithms` and compare results.
For …
-
Hi there,
I have recently expanded the analysis by Czech and Stamatakis regarding branch support mapping after tree rooting in tree viewers, and found that some phyloinformatics toolkits might also m…
-
Hi,
Thanks for writing graphmatch! It's a very nice Ruby gem for solving a useful problem.
I noticed an issue however where graphmatch does not return matches when vertices on either side of the bi…
-
# Tasks
1. - [ ] add property-records to graph (or explain why not)
2. - [x] migrate to factor graph (or explain why not)
**A. Add property-record nodes that assign a property+value to other nod…
-
[Prepona](https://github.com/maminrayej/prepona) was a huge inspiration in separating the graph abstraction from graph data storage. The question is how should we approach that to benefit from this se…
-
例如
>g = dgl.heterograph({
> ('user', 'follows', 'user'): ([0, 1], [1, 1]),
> ('game', 'attracts', 'user'): ([0], [1])
>})
有没有类似下面的这种写法?
>g = dgl.heterograph()
>g.add({('user', 'foll…
-
- List all the use cases that will be satisfied by the web application.
- Categorize them as "new" or "replication".
- Analyze their importance for "general exploration" or "use by ISPs".