Analysis of dijkstra.c
----------------------

Operations
----------

  Tracked using counters in the code.

  Nodes Links   Function Calls / FC per Node    Loop Traversals / LT per Node   Filename
  ----- -----   ----------------------------    -----------------------------   --------

  6     6       343         57                  1950        325                 6_nodes.net
  12    12      2269        189                 25932       2161                two.net
  24    26      16193       674                 403122      16796               24_nodes.net


CPU
---

  Collected using the time command.

  Nodes Links   real            user            sys             Filename
  ----- -----   ----            ----            -----           --------
  6     6       0m0.025s        0m1.006s        0m0.013s        6_nodes.net
  12    12      0m0.029s        0m0.022s        0m0.021s        two.net
  24    26      0m0.080s        0m0.057s        0m0.016s        24_nodes.net


Memory 
------

  There are four arrays which are the dominant data structures.  They grow linearly with the 
  number of nodes and links.  One of the arrays is static which is likely to lead to it being 
  cached close to the processor.  


I/O
---

  Minimal, reading the network description and writing a routing table for each node.