Viewing profile — s_tim

How does this compare to Enzyme ( https://enzyme.mit.edu/ )?

But you would need to spend the $15 on every request whereas the RAG approach would be most likely significantly cheaper per request.

You build from the different tuples in your list just one graph. Then it's just a simple DFS/BFS with one random start node. Which gives you your first component. Then you can get …

You could model the problem as a graph (each integer represents a vertex and two consecutive integers an edge, e.g. (1, 2, 3) is a graph with nodes 1,2,3 and edges between 1 and 2 …