Skip to content
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

Pre multi graph #1695

Merged
merged 28 commits into from
Jul 30, 2024
Merged

Pre multi graph #1695

merged 28 commits into from
Jul 30, 2024

Conversation

fabianmurariu
Copy link
Collaborator

@fabianmurariu fabianmurariu commented Jul 18, 2024

What changes were proposed in this pull request?

Move most of the graph logic into GraphStorage
Add iter in Nodes that returns NodeView with references and avoid clones
hand node ids that are strings better

Why are the changes needed?

Simplify the implementation of a multi graph

Does this PR introduce any user-facing change? If yes is this documented?

No

How was this patch tested?

Issues

#1686

Are there any further changes required?

Copy link
Contributor

@github-actions github-actions bot left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

⚠️ Performance Alert ⚠️

Possible performance regression was detected for benchmark 'Rust Benchmark'.
Benchmark result of this commit is worse than the previous benchmark result exceeding threshold 2.

Benchmark suite Current: aa0722b Previous: b0fe8cb Ratio
lotr_graph/has_node_existing 17 ns/iter (± 1) 6 ns/iter (± 0) 2.83

This comment was automatically generated by workflow using github-action-benchmark.

@fabianmurariu fabianmurariu marked this pull request as ready for review July 24, 2024 13:43
Copy link
Collaborator

@ljeub-pometry ljeub-pometry left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Some minor things to cleanup, shouldn't use GID as the output format for algorithms

"# checking edge 1,2 exists and 2,1 doesn't as Raphtory is directed\n",
"print(g.has_edge(1, 2), g.has_edge(2, 1))\n",
"print(g.has_edge(\"1\", \"2\"), g.has_edge(\"2\", \"1\"))\n",
"# Check the total number of edges and nodes\n",
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Instead of changing all the numbers to strings, we probably should make the example with string ids use a new graph instead so this still explains both scenarios

Copy link
Collaborator

@ljeub-pometry ljeub-pometry left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Good to merge

@miratepuffin miratepuffin merged commit a6371a2 into master Jul 30, 2024
19 checks passed
@miratepuffin miratepuffin deleted the pre_multi_graph branch July 30, 2024 09:52
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.

3 participants