Digraphs
Digraphs copied to clipboard
digraphs
The GAP package Digraphs
A _cut set_ of a digraph `D` is any set of edges whose removal disconnects it. The _edge connectivity_ of `D` is the minimum size of any cut set of...
Resolves issue #580. Edited `oper.gi` file to allow `D ^ p` (digraph and permutation) and `D ^ t` (digraph and transformation) to call `OnDigraphs(D, p)` and `OnDigraphs(D, t)`, respectively.
Issue - `https://github.com/digraphs/Digraphs/issues/683` Previously, deleting vertices or edges from an EdgeWeightedDigraph or taking a mutable copy caused the resulting digraph to lose its edge weights. This commit is just a...
This follows on from #545, in which @TomGoertzen noticed that the `HamiltonianPath` function from Digraphs versions 0.x and 1.x only looks for and returns Hamiltonian *cycles*, even though the more...
Let $D$ be an edge weighted digraph and $s, t$ be two vertices. A cut-set with source $s$ and target $t$ is, in some sense, a set of edges whose...
Now that #864 will imminently fix #708, we have a `SwapDigraphs` method that allows us to avoid messing around with `!.OutNeighbours :=` statements and similar hacks. We should look for...
I've made a GAP pull request at https://github.com/gap-system/gap/pull/4343 which makes a few pluralisation-related changes. The change most relevant to this issue is that it changes “1 arguments” to “1 argument”...
Because Digraphs is now an extension of the GraphViz package. Connected to https://github.com/digraphs/graphviz/pull/43.
I broke these out from @james-d-mitchell code in #644 for safekeeping since they were separate and anyway, they were making the CI fail. I'm not sure what the plan is,...
Following my comparison of features in Sage vs. GAP, I added functions computing the radius, periphery, and centre of a strongly connected digraph (`DigraphRadius`, `DigraphPeriphery`, `DigraphCentre`). Could be merged with...
