Skip to content

Conversation

@jcristau
Copy link
Contributor

@jcristau jcristau commented Nov 5, 2025

Detect dependency cycle instead of looping forever.

@jcristau jcristau force-pushed the loop branch 5 times, most recently from 2eddb4c to d99bd1e Compare November 6, 2025 11:38
@jcristau jcristau marked this pull request as ready for review November 6, 2025 11:41
@jcristau jcristau requested a review from a team as a code owner November 6, 2025 11:41
Copy link
Contributor

@Eijebong Eijebong left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Just one nit about visit_postorder's doc, rest looks correct to me. And we get rid of one slow handrolled graph traversal algorithm (probably doesn't matter in this case) and we get cycle detection in all graph traversals out of it.

Avoid silently returning a subset of nodes.
Detect dependency cycles instead of looping forever, by using
taskgraph.graph.Graph instead of a custom graph traversal.
Update the graphs in the tests to not have multiple tasks with the same
label, as that breaks uniqueness assumptions.
@jcristau jcristau enabled auto-merge November 6, 2025 13:35
@jcristau jcristau merged commit af5713d into taskcluster:main Nov 6, 2025
16 checks passed
@jcristau jcristau deleted the loop branch November 14, 2025 11:54
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants