-
Notifications
You must be signed in to change notification settings - Fork 70
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
DrTimothyAldenDavis
wants to merge
770
commits into
stable
Choose a base branch
from
v1.2
base: stable
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
LAGraph v1.2 #308
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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
…o incidence_GraphBLAS_10
added greedy algorithm as a benchmark edited main algorithm and benchmarks as well
…raph into with_GraphBLAS_v10
added MIS algorithm, test, and benchmark
…aph-coloring into v1.2-with-coloring
Incidence Matrix Updated for GraphBLAS v10
…raph into with_GraphBLAS_v10
updates for GraphBLAS v10.0.0
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)
coloring methods
revise triangle count after changing random number generator
…raph into with_GraphBLAS_v10
testing triangle count
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.