Visit the preview URL for this PR (for commit 6039af5):

https://cp-algorithms--preview-1209-eabgfr0z.web.app

(expires 2023-12-24T06:10:05.233219746Z)

Visit the preview URL for this PR (for commit d7bd15d):

https://cp-algorithms--preview-1209-eabgfr0z.web.app

(expires 2023-12-24T06:53:52.600141381Z)

Visit the preview URL for this PR (for commit 3760b39):

https://cp-algorithms--preview-1209-dw9hglqn.web.app

(expires 2024-01-11T13:39:33.190788334Z)

Thanks for the pull request! I also see the message "This branch cannot be rebased due to conflicts", could you resolve it, if possible? I think one particularly important example to mention is how to compute aggregate functions on directed acyclic graph (for example, how to find the longest path from each vertex, or how to find the number of paths starting in each vertex). This example is particularly important because, in essence, every dynamic programming problem can be reduced to computing some aggregate functions over the vertices of a directed acyclic graph.

I'm not able to replicate the error you're seeing. The preview seems to work for me. Does it work for you? I agree that I could add more about topological ordering/DAG but I sort of feel like this may be more appropriate for an intermediate article as it requires knowledge of DAG and topological sort. The current article requires no such knowledge.

I'll look into the error message and see what I can do.

Sorry it took so long...

I've fixed a formula and added 2 short sentences.