-
Hi there.
I found your library when I was looking for Nauty alternative for Java. Without any offence, after adapting your code I was disappointed its issues and performance. Then I managed to writ…
-
Add the functionality to deal with edge weighted graphs similar to nauty-pet, which is the rust library that implements nauty for petgraphs. The code for it in rust is in this file
https://github.…
-
### What is your question?
Hi,
In my current project I have a main conanfile.py at the root level. I also defined 3 conanfile.py files for dependencies in subfolders `project/dependencies/dep1|2…
-
### Describe the bug
Hi,
I have set my package into editable mode and tried to test the package with the sample test_package from the docs (https://docs.conan.io/2/tutorial/creating_packages/test_…
-
Hi All,
Hopefully this is the correct place to report this. I've been having some trouble with the command generateGraphs from the Nauty package. I have Macaulay 1.13 on my machine, and I also re…
-
Much slower:
0.6
```julia
julia> @benchmark Nauty.baked_canonical_form(iso1a).canong
BenchmarkTools.Trial:
memory estimate: 1.38 KiB
allocs estimate: 27
--------------
minimum time…
-
Hi, I'm trying to work with graphs with larger than 64 vertices, and I'm stuck trying to get it to work. Looking at Section 4 of the nauty manual, it seems like I should set `MAXN=0` so that memory is…
-
```
gap> gr := Digraph(IsMutableDigraph, [[2, 2], []]);
gap> DigraphsUseBliss();
#I Using bliss by default for AutomorphismGroup . . .
gap> AutomorphismGroup(gr);
Group([ (), (1,2) ])
gap> Di…
-
There are many points where we consider all possible assignments of a foreign key (such as branching on an unassigned one, or at many points in the colimit code e.g. detecting if two components are co…
-
Version:
```
SCIP version 10.0.0 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Soplex 7.1.0] [GitHash: 820c627c95]
Copyright (c) 2002-2024 Zuse Institute Berlin (ZIB)
Externa…