ne_evo.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_evo.h"
#include <stdio.h>


ne_err_code_t ne_evo_initial (ne_sys_t *sys, FILE *evoFile)
{
   int i, nodes, edges;
   char curStrBuffer[100];
   
   nodes = ne_sys_nodes(sys);
   edges = ne_sys_nodes(sys);
   
   for (i=0; i<nodes; i++) {
      ne_evo_add_node(curStrBuffer, 0);
      fprintf(evoFile, "%s", curStrBuffer);
   }
   
   for (i=0; i<edges; i++) {
      ne_evo_add_edge(curStrBuffer, (ne_int_t)IGRAPH_FROM(sys->graph, i), 
                  (ne_int_t)IGRAPH_TO(sys->graph, i), 0);
      fprintf(evoFile, "%s", curStrBuffer);
   }
   
   fprintf(evoFile, "%s", ne_evo_step(NE_STEP_PAUSE));
   fflush(evoFile);
   
   return NE_SUCCESS;
}


ne_err_code_t ne_evo_add_node (char *str, ne_int_t type)
{
   sprintf(str, "N+,%i\n", (int)type);
   return NE_SUCCESS;
}


ne_err_code_t ne_evo_del_node (char *str, ne_int_t node)
{
   sprintf(str, "N-,%i\n", (int)node);
   return NE_SUCCESS;
}


ne_err_code_t ne_evo_add_edge (char *str, ne_int_t startNode, ne_int_t endNode, ne_int_t type)
{
   sprintf(str, "E+,%i,%i,%i\n", (int)startNode, (int)endNode, (int)type);
   return NE_SUCCESS;
}


ne_err_code_t ne_evo_del_edge (char *str, ne_int_t startNode, ne_int_t endNode)
{
   sprintf(str, "E-,%i,%i\n", (int)startNode, (int)endNode);
   return NE_SUCCESS;
}


ne_err_code_t ne_evo_set_node_type (char *str, ne_int_t node, ne_int_t type)
{
   sprintf(str, "N!,%i,%i\n", (int)node, (int)type);
   return NE_SUCCESS;
}


ne_err_code_t ne_evo_set_edge_type (char *str, ne_int_t startNode, ne_int_t endNode, ne_int_t type)
{
   sprintf(str, "E!,%i,%i,%i\n", (int)startNode, (int)endNode, (int)type);
   return NE_SUCCESS;
}


char * ne_evo_step (ne_evo_step_t type)
{
    if (type == NE_STEP_PAUSE) return "---\n";
   else if (type == NE_STEP_DYN) return "-\n";
   else if (type == NE_STEP_EVO) return "--\n";
   else return "";
}