Skip to content

issues Search Results · repo:python-graphblas/graphblas-algorithms language:Python

Filter by

17 results
 (120 ms)

17 results

inpython-graphblas/graphblas-algorithms (press backspace or delete to remove)

So I see for a single path we can do parent bfs and reconstruct the path. Is there a technical reason APSP is only lengths and not all paths? Such as the multi source parent tracking is hard? I ve been ...
  • williamcolegithub
  • Opened 
    7 days ago
  • #98

Hi all! Still getting used to the graphblas bindings and writing efficient enough algorithms to contribute effectively, but I thought I d put a placeholder issue up in case someone else already has progress ...
  • rtbs-dev
  • 1
  • Opened 
    on Sep 12, 2024
  • #97

A few days ago a user posted an issue describing calculation s from NetworkX not matching against Graphblas s implementation on SO. Thought i d pass on the details along as another kind gent has described ...
  • davidsilveiro
  • 1
  • Opened 
    on Apr 30, 2024
  • #96

in ga.Graph.__init__ we can specify key_to_id. I can t see any reason why this must be a stdlib.dict and not any other class that implements the typing.Mapping protocol (__getitem__, __len__, __iter__). ...
  • q-aaronzolnailucas
  • 1
  • Opened 
    on Apr 18, 2024
  • #95

We compute and cache many properties such as has_self_edges, degrees- (w/o diagonals), degrees+ (with diagonals), etc., which is actually very handy. However, the code is a little complicated (cough cough, ...
  • eriknw
  • Opened 
    on Dec 14, 2023
  • #86

From #82, showing graphblas_algorithms.classes.nodemap.NodeMap object at 0x00000206BC590550 is not the most helpful even though a NodeMap is a MutableMapping. So, the repr of NodeMap should be updated ...
  • eriknw
  • Opened 
    on Dec 14, 2023
  • #85

digraphTCC2 = ga.Graph.from_networkx(digraphTCC) clus = nx.square_clustering(digraphTCC2) print(clus) for i in clus: print(i) I ve just found graphblas-algorithms as a way to speed up computations on ...
  • danielverd
  • 14
  • Opened 
    on Dec 4, 2023
  • #82

Now that we have a logo for python-graphblas (https://github.com/python-graphblas/python-graphblas/pull/506), I suppose the logical next step is to make a logo for graphblas-algorithms. It would probably ...
  • eriknw
  • 3
  • Opened 
    on Oct 8, 2023
  • #76

We would like to be able to compare performance to igraph: https://github.com/igraph/python-igraph Some algorithms may be different, which can make direct comparisons difficult to do well (for example, ...
  • eriknw
  • 1
  • Opened 
    on Mar 10, 2023
  • #53

We would like to be able to compare performance to graph-tool: https://graph-tool.skewed.de Some algorithms may be different, which can make direct comparisons difficult to do well (for example, stopping ...
  • eriknw
  • Opened 
    on Mar 10, 2023
  • #52
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Restrict your search to the title by using the in:title qualifier.
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Press the
/
key to activate the search input again and adjust your query.
Issue search results · GitHub