<s>[INST] I'm working on a recursion assignment with a graph algorithm (it's Dijkstra's algorithm), and I was wonder if those types of algorithms (specifically ones relying on pointer/matrix handling) are generally implemented using recursion or iteration?[/INST]