Routing (Part Three)

29-30th Dec 2012 - The 15th and 16th meeting dealed with routing. Going from Pointers to Static Array.

 

Planning ahead

Pointers setback

When we started debugging the pointer functions we realized that "no Dynamic Memory Allocation" means really no Dynamic Memory Allocation. The function that would generate a node and return it back to be inserted in the route sequence was always using the same memory address, overwriting the previous node created. This meant all work done for pointer management was useless. 

Static position vector 

So, there was no fancy way to do it. We had  to define a static vector with enough positions for all routing needs. So that's what we're doing this weekend. After having this working reasonably well, we'll start on decision algorithms, to know where to go, to generate destinations to the routing algorithm.