flâneur

Algebraic Path Finding | Iago Leal

iagoleal.com · 5,127 words · saved by 1 readers

There’s something magical about polymorphic algorithms. Really, isn’t it awesome to write a piece of code once and then just tweak the meaning of some inputs to solve another seemly unrelated problem? Let’s see an example of those with applications ranging from regular expressions to matrix inversion, with a lot of useful queries on graphs along the way.

There’s something magical about polymorphic algorithms. Really, isn’t it awesome to write a piece of code once and then just tweak the meaning of some inputs to solve another seemly unrelated problem? Let’s see an example of those with applications ranging from regular expressions to matrix inversion, with a lot of useful queries on graphs along the way. Today we will continue our explorations in the land of dynamic programming but with a much more abstract view. As it stands, dynamic programming in a finite horizon isn’t necessarily concerned with solving optimization problems. It can be abst

related reading