Your method is super interesting. I think the theme of this question was to use topological sort O(V+E), but you've solved it using custom sort function O(nlogn). Nice use of the custom sort option (and the set it to 1 whenever the ordering is False). In terms of the sorting efficiency though not sure it would be efficient as it would have many 'equal' comparisons (harder to divide and conquer?)
![Ceres Search [Day 4 - Advent of Code 2024 - Python]](http://i.ytimg.com/vi/lFi5cMYJAlM/mqdefault.jpg)
![Ceres Search [Day 4 - Advent of Code 2024 - Python]](/img/tr.png)
![Disk Fragmenter [Day 9 - Advent of Code 2024 - Python]](http://i.ytimg.com/vi/5k8O1EloI5M/mqdefault.jpg)
![Bridge Repair [Day 7 - Advent of Code 2024 - Python]](http://i.ytimg.com/vi/Np6ti3t36XA/mqdefault.jpg)
Your method is super interesting. I think the theme of this question was to use topological sort O(V+E), but you've solved it using custom sort function O(nlogn). Nice use of the custom sort option (and the set it to 1 whenever the ordering is False). In terms of the sorting efficiency though not sure it would be efficient as it would have many 'equal' comparisons (harder to divide and conquer?)