[sage-support] Sage Installation - Problem with untar-ing Linux Binaries

-bit Intel machine. I tried untarring the 32-bit version too, but still I get the same error. Thanks in advance Regards Kishore --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL

[sage-support] Re: Sage Installation - Problem with untar-ing Linux Binaries

The size of the tar ball is less than what you mentioned -rw--- 1 kishore pointcount 236711936 Feb 12 21:01 sage- sage-2.10.1-linux-debian64-intel-x86_64-Linux.tar.gz Nevertheless, I proceeded continuing and when I typed the command 'sage' , I got an error mentioning that "Y

[sage-support] Re: Sage Installation - Problem with untar-ing Linux Binaries

Thank you very much. I indeed had to follow a round-about way of installing because of the incomplete download of the tar file. The problem is fixed now and SAGE is working fine. Thanks and Best Regards Kishore On Feb 15, 5:52 pm, mabshoff <[EMAIL PROTECTED] dortmund.de> wrote: > On

[sage-support] Re: search_def(), search_src() are not working in Sage

Sorry for not mentioning earlier. My platform is Ubuntu 20.04 LTS and my Sage version is 'SageMath version 9.0, Release Date: 2020-01-01'. I used 'sudo apt install sagemath sagemath-jupyter sagemath-doc-en' to install sage along with sagemath-jupyter and sagemath-doc-en I also cloned the GitHub

[sage-support] Rank of a graph

Hi everyone, I was going through the concept of graphs as matroids and I came upon the rank of a graph. Wikipedia lists it as n - c, n = |V|, c = # of connected components. I do understand rank and nullity of matrices, and graphs when expressed in their incidence matrix form have a one-to-one

[sage-support] Implementation of Kruskal's algorithm using priority queues

Hi everyone, Is there a way to implement Kruskal's algorithm for finding the MST of an undirected graph using priority queues? The standard implementation uses the disjoint set data structurel but I was curious if a PQ implementation is possible, and potentially even better in time complexity.