Skip to content

LAGraph v1.2 #308

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 770 commits into
base: stable
Choose a base branch
from
Open

LAGraph v1.2 #308

wants to merge 770 commits into from

Conversation

DrTimothyAldenDavis
Copy link
Member

No description provided.

hmukesh5 and others added 30 commits February 21, 2025 13:32
Add regular path query algorithm
V1.2 sync to branch with_GraphBLAS_v10
removed self edges when reading, also removed prints
accidentally removed the break from the loop
had incorrect algorithm time, fixed that
fixed/rearranged codes/comments
changed seed in IS algorithm
added greedy algorithm as a benchmark
edited main algorithm and benchmarks as well
added MIS algorithm, test, and benchmark
Incidence Matrix Updated for GraphBLAS v10
DrTimothyAldenDavis and others added 30 commits May 7, 2025 13:32
testing on risc-v emulated architecture
LAGr_BreadthFirstSearch_Extended
revise BFS-extended; add many_expected parameter
V1.2: minor changes from sync with stable
reset README.md
deleted small-undirected-unweighted.mtx file
moved + renamed NetworkX greedy-coloring.py file
this algorithm was based off of a paper, and an improved/more optimized version of this has been written as the independent set algorithm
because it's slower than NetworkX Python greedy approach
changed the method name from LAGraph -> LG for random init and finalize functions
coloring algorithms (experimental)
revise triangle count after changing random number generator
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

8 participants