Digraphs

Digraphs copied to clipboard

Implement further "named" graphs

14

This issue is a feature request to implement a number of "named" graphs from the literature: - [x] [FolkmanGraph](https://en.wikipedia.org/wiki/Folkman_graph) (FB + MT + RC + SH) #386 - [x] [Goldner–Harary...

james-d-mitchell

The handling of edge labels is sometimes very slow

4

**UPDATE:** _Although in #509 I have resolved the specific problem highlighted in this issue, there are still ideas in this issue thread that I think should be addressed. Namely, other...

wilfwilson

Make behaviour of `DigraphRemoveEdge{s}` consistent when removing no edges

6

Added an additional method to preserve properties in the case of empty removals. This addresses issue #260. _(Note from Wilf: currently only partially.)_

Peter-Ing

Speed up `OnDigraphs` for a digraph and a permutation

3

This came up from some code which was heavily using digraphs. this almost doubled the speed of the algorithm, as it turns out these GAP-level checks were dominating the run-time...

ChrisJefferson

`HamiltonianPath` checks for Hamiltonian cycles

2

The function `HamiltonianPath` computes hamiltonian cycles which is a bit confusing if someone looks for paths and not cycles. A name change to `HamiltonianCycle` perhaps would be nice.

TomGoertzen

hrj4

Use autodoc to generate the documentation

1

In Semigroups v4.0.0, we started using autodoc to produce the documentation, this has a number of advantages, and can be used with the current documentation sources (i.e. doesn't require to...

james-d-mitchell

Add `AmalgamDigraphs`

2

Based on [Issue #428](https://github.com/digraphs/Digraphs/issues/428). This pull request adds two functions: AmalgamDigraphs and AmalgamDigraphsIsomorphic. Description: _The AmalgamDigraphs function takes as input two digraphs and two lists of vertices corresponding to two...

finnbuck

Add `UnweightedBellmanFord`

1

baydrea

Implement `DigraphContractEdge`

2

hrj4