Digraphs
Digraphs copied to clipboard
digraphs
The GAP package Digraphs
This PR: * Creates an action for running gap tests with code prepended to the gap command, allowing for GAP to be run with Valgrind (amongst other things). * Creates...
Contains the following: Dynamic memory allocation and deallocation for Homomorphism Dynamic memory allocation and deallocation for Cliques Subtle bug fix for Bliss Graphs when N > 512/3 (see the old...
It would be nice to figure out how to include images in the documentation. This would be useful, for example, in displaying equations.
- Updated the old displaying code of the digraphs package - Added new equivalents which output graphviz objects - Updated existing test code so new version passes (validated maually that...
Currently if `digraph` is immutable: - `DigraphRemoveEdges(digraph, [ ])` returns `digraph`, but - `DigraphRemoveEdges(digraph, [[src, ran]])` always returns an immutable copy of `digraph` even when `[src, ran]` is invalid, and...
I get the following: ~~~ gap> D := DigraphMutableCopy(D); gap> DigraphRemoveAllMultipleEdges(D); gap> DigraphReflexiveTransitiveReduction(D); Stack trace (most recent call last): #31 Object "/homer1/jdm3/gap-4.13.0/gap", at 0x4d6521, in #30 Object "/homer1/jdm3/gap-4.13.0/gap", at 0x4d539f,...
There's a `DigraphCliquesRepsAttr` but no `DigraphCliquesAttr` so if we compute `DigraphCliques(D)` on an immutable digraph `D`, then the result is not cached.
It would be useful to implement `IsPartialOrderCoveringDigraph` and `IsLatticeCoveringDigraph` properties which check that a given digraph is the [covering relation](https://en.wikipedia.org/wiki/Covering_relation) (the reflexive transitive reduction) of some partial order or lattice...
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...