-
The current implementation has no support for edge labels and this is a serious limitation. Let's use this issue to discuss possible designs.
As an example, consider a graph with vertices `1`, `2`,…
-
Hi,
I would like to render a hypergraph (with edges connecting > 2 vertices). I understood that I need to use SetHypergraph instead of Graph (which is confusing because Graph implements Hypergraph…
-
Hi,
there is a [bug report](https://bugs.debian.org/902945) against the Debian packaged version of igraph about an issue which was caused by the upload of arpack version 3.6. The issue is
197…
-
The current implementation of tensor_product is wrong, at least for undirected graphs. The tensor product of bipartite graphs consist of two connected components, and currently
```
julia> using Lig…
-
The pomegranate `FactorGraph` class exposes methods for construction that are primarily concerned with manipulating the graph structure: `add_node` and `add_edge`. However, when learning this library,…
-
There are a handful of work streams that we left off before Easter:
# Data preprocessing
- This has been dealt with now (hopefully) but following the issues with my laptop back in March, I lost my…
-
The [Steiner tree problem](https://en.wikipedia.org/wiki/Steiner_tree_problem) is the problem of computing a minimum weight tree connecting a given subset of nodes. This problem is NP-complete, but th…
-
A graph is unicyclic if it is connected and has order==size.
A graph is locally unicyclic if all of its local subgraphs are unicyclic.
```
def is_locally_unicyclic(g):
V = g.vertices()
fo…
-
Here's a list of all strongly regular graphs up to 64 vertices:
http://www.maths.gla.ac.uk/~es/srgraphs.php
Wikipedia has a list of all cubic distance regular graphs:
https://en.wikipedia.org/wik…
-
Contemplated in #232 and #257. I just saw that [`snakemake`](https://bitbucket.org/snakemake/snakemake/) allows any number of output files, and I think `drake` should try to catch up.
```r
drake_p…