James Mitchell

Lack of detail in `DigraphHomomorphism` documentation

2

From Gordon Royle via the GAP forum: I am using the GAP package “digraphs” to determine whether or not there is a homomorphism from a digraph d1 to a digraph...

Fix compiler warnings

2

We observed the following: 

Withdraw multidigraphs and implement edge-coloured digraphs instead

3

We already stopped adding new methods for multidigraphs, the main issue is that there is no way to distinguish between the multiple edges. To address this I propose removing support...

Implement `QuotientsDigraph`

3

As the title says, it'd be good to have a function that computed all the quotients of a given digraph. I'm not sure how feasible this is really, but it'd...

When I commented on Issue #92 that I was "currently" resolving the issue (in 2017), I made the changes in this PR. This is incomplete, but I thought I'd make...

Implement `IsOrderIdeal` for a subset of a partial order digraph

3

This property would return `true` if the specified subset was "downwards" closed, i.e. contains every node less than the given nodes. This could more or less easily be done using...

See https://en.wikipedia.org/wiki/Cycle_basis#Polynomial_time_algorithms for details

Implement ContractEdge

3

For a digraph, node, and node.

Implement more properties of lattices

11

It would be helpful to have methods for ~~`IsDistributiveLatticeDigraph` and~~ `IsModularLatticeDigraph` and perhaps some more.

32-bit support

1

My reading of @fingolfin's last comment on: https://github.com/gap-actions/setup-gap/issues/45 is that 32-bit continuous integration for GAP is not currently feasible (or at least not worth the effort). I tend to agree,...