Digraphs
Digraphs copied to clipboard
digraphs
The GAP package Digraphs
The function `FacialWalks` takes something called a “rotation system” as its second argument. I'm not exactly sure what this is, but anyway, `FacialWalks` does an incomplete check that its second...
It would be nice if there was a function to create an edge-weighted digraph from a given digraph by assigning each edge a weight of 1, e.g. `UnitEdgeWeightedDigraph(D)`. Currently if...
A digraph `D` is _strongly connected_ if for every pair of vertices `u, v` in `D` there exists a directed path starting at `u` and ending in `v` and a...
The way weighted digraphs are currently implemented causes the following rather confusing behavior: ```gap gap> D := Digraph(IsImmutableDigraph, [[2], []]); gap> De := EdgeWeightedDigraph(D, [[1], []]); gap> EdgeWeights(De); [ [...
As reported by @saffronmciver in https://github.com/digraphs/Digraphs/issues/737#issuecomment-3300489799, there is a problem with `Bridges`. The manual says: ``` ‣ Bridges( D ) ─────────────────────────────────────────────────────────────────────────── attribute Returns: A (possibly empty) list of edges. A...
This question was raised in #260, specifically in @saffronmciver's comment https://github.com/digraphs/Digraphs/issues/260#issuecomment-2622143901. What does everyone think? I think that either Whatever we choose, we should be consistent, and make sure that...
In `doc/io.xml`, the documentation for the functions `DigraphFile`, `ReadDigraphs`, and `WriteDigraphs` all contain the following chunk of text, or something almost identical: ```xml The currently supported file formats, and associated...
I should look into this properly, but just to get something down: As far as I recall, we can check whether a graph is Biconnected and even k-connected (strongly? weakly?)...
It's quite a big blob (currently 35MB) that, since it is a compressed `.tar.gz` archive, is an essentially completely different file with each minor change. I don't think it's really...
I'm assuming that the maximum number of vertices supported by the homomorphism finding code is `MAXVERTS`, which is currently defined in `src/perms.h` as 65534: https://github.com/digraphs/Digraphs/blob/d5beb4d6ed0c67a3bf337c62384338701fd0d50d/src/perms.h#L29 It took me a while...