Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
No description, website, or topics provided.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Conedy is a scientific tool for the numerical integration of dynamical systems, whose mutual couplings are described by a network. Its name is an abbrevation of “Complex Networks with Dynamics”. see http://www.conedy.org for documentation Build dependencies on a debian-based system: sudo aptitude install debhelper cdbs python-all-dev boost-build libboost-dev libgsl0-dev libboost-dev libboost-python-dev libboost-iostreams-dev libz-dev python-support bisonc++ flex texlive-latex-base python-sphinx texlive-latex-recommended texlive-latex-extra texlive-fonts-recommended vim-common dvipng --- Some introduction to the source code: The main object which is managed and modified in Conedy is an instance of the class MyNetwork as defined in fullnetwork.h. This instance represents an edge array representation of a graph in which nodes represent dynamical systems and edges represent coupling between these systems. The functions which allow one to modify or observe this network are seperated into different subclasses which are merged together by inheritance: The Network: network.h: In this file the base class network is defined, which maneges the data structure of the network and implements elementary functions which add single edges or nodes to the network dynNetwork.h: The class dynNetwork extends network by functions which are specific to numerical integration and setting initial conditions. createNetwork.h: In this file the class createNetwork is defined, which extend network by generators for more complicated networks (lattices, random networks, etc.) and by functions which add specialized observe nodes which during time evolution write some property to output files. statisticsNetwork.h: Adds some network characteristics to the network interface class. spatialNetwork.h: Adds three dimensional coordinates to each node in the network. Is currently not used much except for opengl visualization. fullNetwork.h: All these 6 network classes are merged by inheritance to the class networkTemplate, which corresponds to the network objects which is revealed to the interpreter and to Python. The Nodes: node.h: defines the class node which represents an dynamical system. It is only an interface class and does not specify, how the data for edges is handled (see nodeImplement.h). dynNode.h: adds functions to the interface of node which are specific for dynamical systems (time evolution, parameter, degrees of freedom, etc). containerNode.h: groups the memory for the system state of dynNodes into different containers, such that numerical integrators like the gsl can operator on consecutive memory. Different containers are differentiated by a integer template parameter and correspond to different dynamical systems. sdeNode.h, mapNode.h, odeNode.h: adds interfaces for the different functions which define the dynamics. stdOdeIntegrater.h, stdSdeIntegrater.h: defines integrators for the dynamical systems. nodeImplement.h: defines two different implementations for the interface in node.h. nodeTemplateEdges handles edges as an vector of edges. In this way all edges of an node must be of the same type and no virtual function calls are needed for numerical integration. Moreover, edges do not need a v-table and consume less memory. nodeVirtualEdges handles edges as an vector of pointer to edges, allowing for different edge types of a node. The Edges: node.h, edge.h: defines edge and edgeVirtual, which are the base classes for all edges. Edges inherit from a template parameter, which could allow for some kind of filter chain in which different edges are chained after another and perform different transformations of the target state. Depending on the type of the first ancestor, which is either edge or edgeVirtual, the chained calls to getTargetState are either virtual or non-virtual function calls. Edges are planned to be generated automatically like nodes with ini-files. At the moment, only some features of nodes can be combined in a hard-coded way.