René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Algorithm Request: MST (5.6 Algebraic Prim's) ","articleBody":"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 on this. \r\n\r\nI don't see any of the graphblas python bindings implementing Algebraic Prim's from ch. 5.2 in the original _Graph Algorithms in the Language of Linear Algebra_ book. MST is really quite useful to me, but in general as an approximation to the Steiner Tree for a given set of nodes and their metric closure. \r\n\r\nI'm fairly certain the text states we cannot take advantage of the priority queue/heap speedup in linalg method, but perhaps someone has an idea (since Prim's is theoretically O(1) for sufficiently dense graphs, i.e. complete graphs of the metric closure! yay!)\r\n\r\nLet me know if there's other info desired here for the feature request. I'm excited for an alternative to the old scipy `minimum_spanning_tree` method, since it's spending a lot of time on nested graph validation that isn't opt-out. \r\n\r\nThanks!","author":{"url":"https://github.com/rtbs-dev","@type":"Person","name":"rtbs-dev"},"datePublished":"2024-09-12T17:00:54.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":1},"url":"https://github.com/97/graphblas-algorithms/issues/97"}