On Wednesday, March 7, 2018 at 5:53:19 PM UTC, Matthew Lancellotti wrote:
>
> I simply ran 'make'.
>
if you change branches, it might be wise to re-run ./bootstrap and
./configure, as configuration data in configure.ac
etc might change between the branches.
>
> Updating Xcode fixed the issue
I simply ran 'make'.
Updating Xcode fixed the issue.
On Wednesday, March 7, 2018 at 12:04:47 AM UTC-5, Dima Pasechnik wrote:
>
>
>
> On Tuesday, March 6, 2018 at 11:56:59 PM UTC, Matthew Lancellotti wrote:
>>
>> sage: latest version (8.1) (from https://github.com/sagemath/sage, last
>> updated
On Wednesday, March 7, 2018 at 8:44:52 AM UTC, Christian Stump wrote:
>
> Dear Dima,
>
> Ultimately, the classical canonical form/isomorphism implementations run
>> on (di)graphs represented by 0-1 matrices, often
>> with bit entries. So that's how bliss_digraph is represented too.
>>
>
> Thanks
Dear Simon and Dima,
I moved this to https://trac.sagemath.org/ticket/24924 for better
traceability and to show you some code snippets...
Cheers, Christian
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and sto
Dear Christian,
On 2018-03-07, Christian Stump wrote:
> Anyway, looking at sage/graphs/bliss.pyx, it seems easy to modify your
>> code to directly create a bliss graph.
>>
>
> Help there is highly appreciated :-), I don't know how to do that
> appropriately...
Just have a look at sage/graphs/b
Dear Simon,
Anyway, looking at sage/graphs/bliss.pyx, it seems easy to modify your
> code to directly create a bliss graph.
>
Help there is highly appreciated :-), I don't know how to do that
appropriately...
Christian
--
You received this message because you are subscribed to the Google Gr
Dear Dima,
Ultimately, the classical canonical form/isomorphism implementations run on
> (di)graphs represented by 0-1 matrices, often
> with bit entries. So that's how bliss_digraph is represented too.
>
Thanks for this info clarifying that it seems impossible to feed the
algorithm any other k
On 2018-03-07, Dima Pasechnik wrote:
> Ultimately, the classical canonical form/isomorphism implementations run on
> (di)graphs represented by 0-1 matrices, often
> with bit entries. So that's how bliss_digraph is represented too.
> Constructing it directly might be beneficial, especially if you
