Colony

#include "intersectData.h"

/* Data is sent in the following order

 * INT0_NUM OUTEDGE_0 OUTEDGE_1 ... \n

 * INT1_NUM OUTEDGE_0 ... \n

 * ...

 * ...

 */

/* Representation of an edge (road) */

typedef struct {

        char to;        /* Where does this edge lead to? */

        char dist;        /* Where does it come from?        */

}edge

/* Representation of an intersection on the graph */

typedef struct {

        char type;         /* Note that there are at most 5 intersection types */

        char intNum;        /* What is the intersection number */

        char numOut;        /* Note that we can have no more than 4 outgoing edges */

        char outSeen;        /* The number of the outgoing edges that we have seen for this intersection */

        edge[4] outgoingEdges;

}node

/* A union that is used in wireless transmissions */

typedef union  {

        node n;

        char array[12];

}node_union

/* This array holds all of the intersections that are represented in the graph

 * after its creation, the graph is transmitted wirelessly */

node[NUM_FEATURES] intersections;