-
Notifications
You must be signed in to change notification settings - Fork 63
fix: add special edge handling in bfs, dfs and base partitioner #150
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
fix: add special edge handling in bfs, dfs and base partitioner #150
Conversation
Summary of ChangesHello @CHERRY-ui8, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed! This pull request significantly enhances the robustness and correctness of the graph partitioning logic by introducing comprehensive validation and filtering for edges. It addresses potential issues arising from malformed or self-looping edges within the base partitioner's batch conversion and the BFS and DFS algorithms, ensuring that the generated graph communities are based on valid and well-formed edge structures. Highlights
Using Gemini Code AssistThe full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips. Invoking Gemini You can request assistance from Gemini at any point by creating a comment using either
Customization To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a Limitations & Feedback Gemini Code Assist may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments. If you're interested in giving your feedback about your experience with Gemini Code Assist for Github and other Google products, sign up here. You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension. Footnotes
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Code Review
This pull request introduces more robust handling for edges, particularly self-loops and malformed edge data, across the base partitioner, BFS partitioner, and DFS partitioner. The changes correctly use frozenset for undirected edges and filter them before creating communities, which prevents potential errors. I've identified one area for improvement related to code duplication between the BFS and DFS partitioners, which could be refactored for better maintainability.
| valid_edges = [ | ||
| tuple(edge) for edge in comm_e | ||
| if isinstance(edge, frozenset) and len(edge) == 2 | ||
| ] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This logic for filtering out invalid edges is duplicated in graphgen/models/partitioner/dfs_partitioner.py (lines 76-79). To improve maintainability and adhere to the DRY (Don't Repeat Yourself) principle, consider extracting this list comprehension into a common helper function. Since both BFSPartitioner and DFSPartitioner inherit from BasePartitioner, a static or protected helper method in the base class would be a suitable location.
This PR enhances the robustness and correctness of the graph partitioning logic by introducing validation and filtering for edges.