This repository was archived by the owner on Jun 18, 2026. It is now read-only.
test: add tests for FamousGraphLibrary - #150
Merged
Merged
Conversation
Verify structural properties of all 12 famous named graphs: - Petersen (10v/15e, 3-regular) - Karate Club (34v/78e) - Konigsberg Bridges (4v/7e) - K3,3 (6v/9e) - Frucht (12v/18e, cubic) - Heawood (14v/21e, cubic) - Dodecahedron (20v/30e, cubic) - Tutte (46v/69e, cubic) - Florentine Families (15v, Medici hub check) - Diamond (4v/5e) - Bull (5v/5e) - Butterfly (5v/6e) Also tests catalog completeness, byName case-insensitivity, null/unknown handling, and full catalog resolution.
|
You have reached your Codex usage limits for code reviews. You can see your limits in the Codex usage dashboard. |
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
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
1 participant
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.
Adds FamousGraphLibraryTest verifying structural properties of all 12 famous named graphs (vertex/edge counts, regularity, hub degrees), plus catalog completeness and byName lookup tests.