int read_graph(FILE ** graphIn,FILE ** heurIn,Node ** newNode,int ** nodeList)
{
    int newCur,newNext,newCost,tempCur,tempNext,tempCost;
    int arlength=1; //array length for Node List or total number of different nodes
    int tempIndex=-1; // index for findNode()

    *newNode=(Node *)malloc(arlength*sizeof(Node)); //create the first Node (array size 1)
    fscanf(*graphIn,"%d %d %d",&tempCur,&tempNext,&tempCost); //scan details for the first node

    arlength++; //since the first node has a destination / next node, then the number of nodes will be increased by 1

    (*newNode)[0].current=tempCur; //store the node name to the node structure array
    (*nodeList)[0]=tempCur; //store the node name to the node List array
    (*newNode)[0].branch=1; //add 1 branch option
printf("%d %d %d\n",(*newNode)[0].current,(*nodeList)[0],(*newNode)[0].branch);
    (*newNode)[0].nextPos=(int *)malloc((*newNode)[0].branch*sizeof(int)); //allocate memory for the branches
    (*newNode)[0].cost=(int *)malloc((*newNode)[0].branch*sizeof(int)); //allocate memory for the branches cost
    *newNode=realloc(*newNode,arlength*sizeof(Node)); //expand the node structure array by 1 element
    *nodeList=realloc((*nodeList),arlength*sizeof(int)); //expand the node List array by 1 element

    (*newNode)[1].current=tempNext; //put the first "next" or branch option as a new element in the structure array.
    (*nodeList)[1]=tempNext; //put the first "next" or branch option as a new element in the node list array.
printf("%d %d\n",(*newNode)[1].current,(*nodeList)[1]);
    (*newNode)[0].nextPos[((*newNode)[0].branch)-1]=tempNext;; // store the branch
    (*newNode)[0].cost[((*newNode)[0].branch)-1]=tempCost; //store the cost of the branch
printf("%d %d\n",(*newNode)[0].nextPos[((*newNode)[0].branch)-1],(*newNode)[0].cost[((*newNode)[0].branch)-1]);

    while(!(feof(*graphIn))) // while the end of file is not reached
    {
    fscanf(*graphIn,"%d %d %d",&newCur,&newNext,&newCost);

    if((newCur!=tempCur)&&(!(isExist(newCur,*nodeList,arlength)))) //when the new Node doesn't exist in the list
        {
        arlength++; //increase the number of Nodes
        *newNode=realloc(*newNode,arlength*sizeof(Node)); //expand the structure array
        *nodeList=realloc((*nodeList),arlength*sizeof(int)); //expand the List array

        (*nodeList)[arlength-1]=newCur; //store the new node to the newly expanded element of the List array
        (*newNode)[arlength-1].current=newCur; //store the new node to the newly expanded element of the structure array
        (*newNode)[arlength-1].branch=1; // add 1 branch option
printf("%d %d %d\n",(*nodeList)[arlength-1],(*newNode)[arlength-1].current,(*newNode)[arlength-1].branch);
        (*newNode)[arlength-1].nextPos=(int *)malloc(((*newNode)[arlength-1].branch)*sizeof(int));//allocate memory for the branch
        (*newNode)[arlength-1].cost=(int *)malloc(((*newNode)[arlength-1].branch)*sizeof(int));//allocate memory for the branch cost

        (*newNode)[arlength-1].nextPos[((*newNode)[arlength-1].branch)-1]=newNext;
        (*newNode)[arlength-1].cost[((*newNode)[arlength-1].branch)-1]=newCost;
printf("%d %d\n",(*newNode)[arlength-1].nextPos[((*newNode)[arlength-1].branch)-1],(*newNode)[arlength-1].cost[((*newNode)[arlength-1].branch)-1]);
        if(!(isExist(newNext,*nodeList,arlength)))
            {
            arlength++;
            *newNode=realloc(*newNode,arlength*sizeof(Node));
            *nodeList=realloc((*nodeList),arlength*sizeof(int));

            (*nodeList)[arlength-1]=newNext;
            (*newNode)[arlength-1].current=newNext;
printf("%d %d\n",(*nodeList)[arlength-1],(*newNode)[arlength-1].current);
            }
        tempCur=newCur;
        tempNext=newNext;
        tempCost=newCost;
        }
    else if((newCur==tempCur)&&(isExist(newCur,*nodeList,arlength))) // checking if the node exists in the list
        {
        tempIndex=findNode(newCur,*nodeList,arlength); //find where the node is

        (*newNode)[tempIndex].branch++;

        (*newNode)[tempIndex].nextPos=realloc((*newNode)[tempIndex].nextPos,((*newNode)[tempIndex].branch)*sizeof(Node));
        (*newNode)[tempIndex].cost=realloc((*newNode)[tempIndex].cost,((*newNode)[tempIndex].branch)*sizeof(Node));
        (*newNode)[tempIndex].nextPos[((*newNode)[tempIndex].branch)-1]=newNext;
        (*newNode)[tempIndex].cost[((*newNode)[tempIndex].branch)-1]=newCost;
printf("%d %d\n",(*newNode)[tempIndex].nextPos[((*newNode)[tempIndex].branch)-1],(*newNode)[tempIndex].cost[((*newNode)[tempIndex].branch)-1]);
        tempCur=newCur;
        tempNext=newNext;
        tempCost=newCost;
        }
    }
printf("final check %d %d %d\n",(*newNode)[5].current,(*newNode)[5].nextPos[0],(*newNode)[5].cost[0]);
return arlength;
}