Skip to content

fix(graphs): use deque and dict indegree for sparse vertex IDs - #15133

Closed
deepshekhardas wants to merge 1 commit into
TheAlgorithms:masterfrom
deepshekhardas:fix/kahns-algorithm-deque
Closed

fix(graphs): use deque and dict indegree for sparse vertex IDs#15133
deepshekhardas wants to merge 1 commit into
TheAlgorithms:masterfrom
deepshekhardas:fix/kahns-algorithm-deque

Conversation

@deepshekhardas

Copy link
Copy Markdown

Fixes #15071. Use collections.deque.popleft() for O(1) queue ops and dict-based indegree to handle sparse vertex IDs.

@algorithms-keeper

Copy link
Copy Markdown

Closing this pull request as invalid

@deepshekhardas, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines.

If you're facing any problem on how to mark a checkbox, please read the following instructions:

  • Read a point one at a time and think if it is relevant to the pull request or not.
  • If it is, then mark it by putting a x between the square bracket like so: [x]

NOTE: Only [x] is supported so if you have put any other letter or symbol between the brackets, that will be marked as invalid. If that is the case then please open a new pull request with the appropriate changes.

@algorithms-keeper algorithms-keeper Bot added the awaiting reviews This PR is ready to be reviewed label Aug 31, 2026
@deepshekhardas
deepshekhardas deleted the fix/kahns-algorithm-deque branch August 31, 2026 07:08
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting reviews This PR is ready to be reviewed invalid

Projects

None yet

Development

Successfully merging this pull request may close these issues.

[BUG] Inefficient pop(0) queue operations and IndexError on sparse vertex IDs in graphs/kahns_algorithm_topo.py

1 participant