Repository navigation
docs: what a vertex holds (edge lists, with example and figure) - #56
Merged
Merged
Conversation
Explains the two edge lists of a vertex (_edgelist, _inlist) and how each graph kind fills them, with a worked example, a drawing of it, the resulting lists, and how the public methods and degrees read them. Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com>
Up to standards ✅🟢 Issues
|
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## main #56 +/- ##
=======================================
Coverage 96.41% 96.41%
=======================================
Files 3 3
Lines 1339 1339
=======================================
Hits 1291 1291
Misses 48 48 ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
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 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.
Adds a "What a vertex holds" part to the Edges & Vertices page, beside the data-structures diagram.
_edgelist,_inlist) and its_graphback-pointer, and what each graph kind puts in them (an undirected loop is held twice).e1/e2,e3, loope4), drawn for bothUGraphandDGraph, with the resulting lists per vertex.Every table row was checked against the source and against the example run on both graph kinds.
Docs only; the build has no warnings.
🤖 Generated with Claude Code