Digraphs
Digraphs copied to clipboard
digraphs
The GAP package Digraphs
The Digraphs package implements a subgraph isomorphism solver in the form of `DigraphEmbedding`. It would good if we could interface with other subgraph isomorphism solver tools, such as https://github.com/ciaranm/glasgow-subgraph-solver.
The current `CayleyDigraph` method is rather inefficient, see excerpt below: ```gap set := AsSet(G); D := Digraph(IsImmutableDigraph, G, set, OnLeftInverse, {x, y} -> LeftQuotient(x, y) in gens); ``` The issue...
On the Digraphs homepage, , the entities `&Digraphs;` and `⪆` are being rendered as-is, not as we want them to be rendered: This should be fixed, either by just having...
The excerpt is: ``` A detailed definition of the DIMACS format can be found at http://mat.gsia.cmu.edu/COLOR/general/ccformat.ps, in Section 2.1. Note that optional descriptor lines, as described in Section 2.1, will...
Colour refinement is an algorithm that takes a graph $G = (V, E)$, and returns a colouring $C \colon V \to \mathbb{N}$ of the vertices such that, for any pair...
Computing all the edges of a partial order or lattice via `DigraphReflexiveTransitiveClosure` can be very time and memory intensive, especially for larger graphs. At the same time, many algorithms for...
This way we can avoid writing `D!.OutNeighbours :=` everywhere in the library.
The [`build-pkg-docs`](https://github.com/gap-actions/build-pkg-docs) action was recently updated to v2.2.0, with a change that ensures that references to other manuals are relative (see https://github.com/gap-actions/build-pkg-docs/pull/35). We should make a new release that includes...
I added a label called "VIP" that I think will be handy for making it easy to find those contributions made by VIPers. Perhaps one of those keen VIPers would...
This adds the function `DigraphMinimumCutSet` using the `DigraphMaximumFlow` method and the max-flow min-cut theorem. See issue #867.
