Digraphs

Digraphs copied to clipboard

Adding Edge Weighted Algorithms

4

RaiyanC

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...

james-d-mitchell

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...

james-d-mitchell

Potential rpath problem with libplanarity

4

I was sitting with @AndreasEnge to update the guix package for GAP, and we tested which packages work. We run into an error that looks a lot like the libsemigroups...

fingolfin

Add `IsDistanceTransitive`

1

https://en.wikipedia.org/wiki/Distance-transitive_graph

wilfwilson

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

james-d-mitchell

Implement `Is2EdgeTransitive`

1

I think this might be a nice thing to have. Here's a definition from https://www.sciencedirect.com/science/article/pii/S0095895615001203: > A 2-arc of a graph is a triple (u,v,w) of pairwise distinct vertices such...

wilfwilson

Implement ContractEdge

3

For a digraph, node, and node.

james-d-mitchell

Implement more properties of lattices

11

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

james-d-mitchell

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,...

james-d-mitchell