I've noticed that CableTickManager performs a Breadth-First Search instead of a Depth-First Search to find all connected cables, for no apparent reason. Using a stack instead of a queue is faster and more memory efficient in this case.

How is it faster and more memory efficient? BFS is easier to implement than DFS without recursion, so unless we have someone profiling data showing that the BFS is a bottleneck I would keep the easier and existing option.

Relevant: https://www.geeksforgeeks.org/difference-between-bfs-and-dfs/