David Eisenstat questions

David Eisenstat answers

• Finding Cycles in Graphs Using Depth-First Search
• Number of even XOR-ed subarrays
• Sorting Geographical non-contiguous line segments along an implied curve
• Finding the continued fraction of 2^(1/3) to very high precision
• Dijkstra's algorithm (updating the heap)
• Generate all digraphs of a given size up to isomorphism
• Shortest way between two points by going through all other points from point collection
• Algorithm for assigning items to groups based on binary criteria
• is bellman-ford can be done in a single iteration?
• How to ignore cycles in a topological sort?