Skip to content

Evaluate directed graph representation #9

Description

@lambda-alpha-labs

The underlying petgraph uses Undirected while relationships (calls, imports, inherits) are directed. Directionality is preserved in the Edge struct but requires manual filtering for traversals.

Proposal

Evaluate switching to a directed petgraph or dual representations. Benchmark on:

  • Neighbor lookup speed (upstream vs downstream)
  • Shortest path accuracy
  • Memory usage
  • Louvain clustering quality

Acceptance

  • Performance benchmarks comparing directed vs current
  • Decision documented with rationale
  • If switching, no test regression

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions