David Eisenstat questions

David Eisenstat answers

• Algorithm for detecting the minimum count of edges to break all loops
• Is this NP-Hard or does a known optimal polynomial time solution exist?
• Fastest way to check if any point from a list is in bwteen two fixed points A and B
• How to cluster lists with shared elements
• Connect series of bridges at midpoint by raising legs
• Bounding box of spherical sector (cone-sphere intersection)
• Longest common prefix based on elements
• Python: how to compute a fast measure of robustness on a network?
• Assigning jobs to workers
• Backtracking: List all possible matrices with row and column sum constraints