נושא: עזרה, גרף -BFS

int i,n;
       City **my_queue;
        City *head;
         Adjacent  *adj;
        for(i=0; i<Size; i++)
        {  
         head_city.colour=WHITE;
           head_city.distance=Size+1;
           head_city.parent=NULL;
        }
        source.colour=GRAY;
        source.distance=0;
        source.parent=NULL;
         
my_queue=(City**)calloc(Size, sizeof(City*));
    assert(my_queue!=NULL);
        my_queue[0]=&source; 
         [0]->colour);
        i=0;
        n=1;
        while(i<n)
        {
          
          head=my_queue;
                 i++;

typedef struct City_t
{
 char* name;
 struct Adjacent_t *next;
 int colour;
 int distance;
 struct City_t * parent;
}City;

typedef struct Adjacent_t
{
 struct City_t *city;  
 struct Adjacent_t *next;
}Adjacent;