Skip to content

Conversation

@CHERRY-ui8
Copy link
Contributor

@CHERRY-ui8 CHERRY-ui8 commented Jan 5, 2026

This PR enhances the robustness and correctness of the graph partitioning logic by introducing validation and filtering for edges.

@gemini-code-assist
Copy link
Contributor

Summary of Changes

Hello @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

  • Robust Edge Handling: Implemented explicit checks to filter out invalid edge formats and self-loops within the community2batch function in base_partitioner.py, ensuring only valid edges are processed.
  • Standardized Edge Representation: Updated the BFS and DFS partitioners to use frozenset[str] for internal edge storage (comm_e), promoting consistency and proper handling of undirected edges.
  • Pre-Community Edge Validation: Added a final validation step in both BFS and DFS partitioners to ensure that only valid, two-node frozenset edges are converted to tuples and included when constructing the Community object.
Using Gemini Code Assist

The 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 /gemini <command> or @gemini-code-assist <command>. Below is a summary of the supported commands on the current page.

Feature Command Description
Code Review /gemini review Performs a code review for the current pull request in its current state.
Pull Request Summary /gemini summary Provides a summary of the current pull request in its current state.
Comment @gemini-code-assist Responds in comments when explicitly tagged, both in pull request comments and review comments.
Help /gemini help Displays a list of available commands.

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 .gemini/ folder in the base of the repository. Detailed instructions can be found here.

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

  1. Review the Privacy Notices, Generative AI Prohibited Use Policy, Terms of Service, and learn how to configure Gemini Code Assist in GitHub here. Gemini can make mistakes, so double check it and use code with caution.

Copy link
Contributor

@gemini-code-assist gemini-code-assist bot left a 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.

Comment on lines 75 to 78
valid_edges = [
tuple(edge) for edge in comm_e
if isinstance(edge, frozenset) and len(edge) == 2
]
Copy link
Contributor

Choose a reason for hiding this comment

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

medium

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.

@ChenZiHong-Gavin ChenZiHong-Gavin merged commit fc84539 into InternScience:main Jan 8, 2026
3 checks passed
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.

2 participants