feat(ir): add graph delegate and iterators #389
Merged
Conversation
This file contains 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
This data structure and its iterators shall reduce complexity for more advanced graph data structures. It manages nodes/edges and we can implement different traversals etc. for it. More advanced graphs can then delegate these operations to the easier to test delegate.
This data structure and its iterators shall reduce complexity for more advanced graph data structures. It manages nodes/edges and we can implement different traversals etc. for it. More advanced graphs can then delegate these operations to the easier to test delegate.
mokouMonday
reviewed
Nov 7, 2024
mokouMonday
approved these changes
Nov 18, 2024
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.
This data structure and its iterators shall reduce complexity
for more advanced graph data structures. It manages nodes/edges
and we can implement different traversals etc. for it.
More advanced graphs can then delegate these operations to the
easier to test delegate.
Please let me know if the term delegate makes sense for you here.