Skip to content
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

feat(ir): add graph delegate and iterators #389

Merged
merged 3 commits into from
Nov 19, 2024

Commits on Nov 6, 2024

  1. feat(ir): add graph delegate and iterators

    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.
    glencoe committed Nov 6, 2024
    Configuration menu
    Copy the full SHA
    868a188 View commit details
    Browse the repository at this point in the history
  2. feat(ir): add graph delegate and iterators

    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.
    glencoe committed Nov 6, 2024
    Configuration menu
    Copy the full SHA
    1cd2a35 View commit details
    Browse the repository at this point in the history

Commits on Nov 14, 2024

  1. Configuration menu
    Copy the full SHA
    3da0dbc View commit details
    Browse the repository at this point in the history