ne_sim_map.c

/*===========================================================================
 NetEvo Foundation Library
 Copyright (C) 2009, 2010 Thomas E. Gorochowski <tgorochowski@me.com>
 Bristol Centre for Complexity Sciences, University of Bristol, Bristol, UK
 ---------------------------------------------------------------------------- 
 NetEvo is a computing framework designed to allow researchers to investigate 
 evolutionary aspects of dynamical complex networks. By providing tools to 
 easily integrate each of these factors in a coherent way, it is hoped a 
 greater understanding can be gained of key attributes and features displayed 
 by complex systems.
 
 NetEvo is open-source software released under the Open Source Initiative 
 (OSI) approved Non-Profit Open Software License ("Non-Profit OSL") 3.0. 
 Detailed information about this licence can be found in the COPYING file 
 included as part of the source distribution.
 
 This library is distributed in the hope that it will be useful, but
 WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 ============================================================================*/


#include "ne_sim_map.h"
#include "ne_dyn.h"
#include "ne_sim.h"
#include <string.h>


ne_dyn_vec_t * ne_sim_map (ne_sys_t *sys, void *params, double *iy, FILE *file)
{
   int i, l, nodes, edges, nStates, eStates, sysStates;
   double *y, *yPrev;
   ne_dyn_vec_t *dyn;
   
   /* We are in discrete time to find number of steps */
   l = ((int *)params)[0];
   nodes = ne_sys_nodes(sys);
   edges = ne_sys_edges(sys);
   nStates = ne_sys_node_states(sys);
   eStates = ne_sys_edge_states(sys);
   sysStates = nStates * nodes * eStates * edges;
   dyn = ne_dyn_vec_alloc(sysStates);
   
   /* Store the initial conditions in the output */
   y = (double *)malloc(sizeof(double) * sysStates);
   memcpy(y, iy, sizeof(double) * sysStates);
   ne_dyn_vec_append_item(dyn, y);
   
   /* Run each step of the simulation */
   for (i=1; i<l; i++) {
      yPrev = y;
      y = (double *)malloc(sizeof(double) * sysStates);
      ne_sim_map_step(sys, yPrev, y, i);
      ne_dyn_vec_append_item(dyn, y);
   }
   
   /* Print dynamics to file if defined */
   if (file != NULL) {
      ne_sim_fprint_dyn_vec(dyn, file);
   }
   
   return dyn;
}


void ne_sim_map_step (ne_sys_t *sys, double *y, double *yNext, int t)
{
   ne_int_t i, j;
   ne_dyn_node_t *nodeDyn;
   ne_dyn_edge_t *edgeDyn;
   
   /* Loop through nodes */
   for (i=0; i<ne_sys_nodes(sys); i++) {
      nodeDyn = ne_sys_dyn_node(sys, i);
      (nodeDyn->fn)(i, (void *)sys, t, y, yNext, ne_sys_dyn_node_params(sys,i));
   }
   
   /* Loop through edges */
   if (igraph_is_directed(sys->graph)) {
      for (j=0; j<ne_sys_edges(sys); i++) {
         edgeDyn = ne_sys_dyn_eid(sys, j);
         (edgeDyn->fn)(j, (int)IGRAPH_FROM(sys->graph, (igraph_integer_t)j), (int)IGRAPH_TO(sys->graph, (igraph_integer_t)j), 
                       (void *)sys, t, y, yNext, ne_sys_dyn_eid_params(sys,j));
      }
   }
   else {
      for (j=0; j<ne_sys_edges(sys); i++) {
         edgeDyn = ne_sys_dyn_eid(sys, j);
         (edgeDyn->fn)(j, (int)IGRAPH_FROM(sys->graph, (igraph_integer_t)j), (int)IGRAPH_TO(sys->graph, (igraph_integer_t)j), 
                    (void *)sys, t, y, yNext, ne_sys_dyn_eid_params(sys,j));
         (edgeDyn->fn)(j, (int)IGRAPH_TO(sys->graph, (igraph_integer_t)j), (int)IGRAPH_FROM(sys->graph, (igraph_integer_t)j), 
                    (void *)sys, t, y, yNext, ne_sys_dyn_eid_params(sys,j));
      }
   }
}