Digraphs

Digraphs copied to clipboard

Re-add PR #459: ExecuteDFS (generic depth first search)

1

This reverts #504, in other words, it adds again the code that was in #459. Since the code in this PR is buggy (see #487), it was removed from the...

wilfwilson

Re-introduce a fixed version of `ExecuteDFS` (Issue #487)

3

This PR fixes some bugs introduced in #459

james-d-mitchell

Add `PancakeGraph`

4

james-d-mitchell

Add `VertexConnectivity`

2

Edit: ( @reiniscirpons ): the current implementation seems have some bug and it fails on `DigraphFromGraph6String("HoStIv{")` (this is [Graph 33668](https://houseofgraphs.org/graphs/33668) on house of graphs). The expected output is 4, currently...

ffloresbrito

Make `DIGRAPHS_OmitFromTests` dynamic?

2

Just a minor note. @fingolfin noticed in https://github.com/digraphs/Digraphs/pull/535#issue-1185461066: > `DIGRAPHS_OmitFromTests` is initialized once and then not updated. This could be fixed, e.g. by removing `DIGRAPHS_OmitFromTests` and modifying the code which...

wilfwilson

Create new version of digraphs-lib with updated URLs

1

The README in `digraphs-lib v0.6` points to the old `gap-packages` URL in two places. This should be updated.

wilfwilson

Nauty AutomorphismGroup of multidigraph fails

1

``` gap> gr := Digraph(IsMutableDigraph, [[2, 2], []]); gap> DigraphsUseBliss(); #I Using bliss by default for AutomorphismGroup . . . gap> AutomorphismGroup(gr); Group([ (), (1,2) ]) gap> DigraphsUseNauty(); #I Using...

wilfwilson

Graphviz

5

This is a reworking of #639, which goes a bit further than #639 in removing the old stuff for displays. This PR doesn't introduce any breaking changes except that we...

james-d-mitchell

Confusing error message in DigraphByEdges

2

``` gap> DigraphByEdges([ [1,2], [3,0] ]); Error, the 1st argument must not contain values greater than 3, the 2nd argument , ``` Well, nothing is greater than 3! What the...

ChrisJefferson

Dreadnaut support

2

Broadly speaking, a dreadnaut file starts with "configuration" information about the graph, such as the number of vertices (denoted by 'n'), the start index for vertex numbering (denoted by '$')...

pramothragavan