Skip to content

Conversation

@Procatv
Copy link
Contributor

@Procatv Procatv commented Jul 29, 2024

Resolves #704

Bulids on PR #707 (Not pushed yet) to implement the general form of the transitive closure of a graph. Implemented function by following structure from @IvanIsCoding:

  • Condense the graph into strongly connect components (which we already implement)
  • Apply the DAG algorithm and get the transitive closure for the intermediate graph
  • Map the answer from the intermediate graph to the original graph

On my testing branch containing the #707 PR as well, all tests pass.

@IvanIsCoding
Copy link
Collaborator

CI should be unblocked now that #1258 is merged

@IvanIsCoding IvanIsCoding added this to the 0.16.0 milestone Nov 16, 2024
@IvanIsCoding IvanIsCoding modified the milestones: 0.16.0, 0.17.0 Dec 4, 2024
@IvanIsCoding IvanIsCoding modified the milestones: 0.17.0, 0.17.1 Jul 6, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

2 participants